Posters of dimension 36”x48” (either portrait or landscape) will be accommodated.
Monday Session:
| Strategic Tradeoffs Between Humans and AI in Multi-Agent Bargaining | Crystal Qian (Google DeepMind); Kehang Zhu (Harvard University); Benjamin Manning (MIT); Vivian Tsai, James Wexler (Google DeepMind); John Horton (MIT and NBER); Nithum Thain (Google DeepMind) |
| High-to-Low Dimensional PPA-completeness: Borsuk-Ulam, Tucker, Consensus Halving, and Ham Sandwich | Ruiquan Gao (Stanford University); Alexandros Hollender (University of Oxford); Aviad Rubinstein (Stanford) |
| MAC Advice For Facility Location Mechanism Design | Zohar Barak (Tel Aviv University); Anupam Gupta (New York University, USA); Inbal Talgam-Cohen (Tel Aviv University) |
| Incentivizing Desirable Effort Profiles in Strategic Classification: The Role of Causality & Uncertainty | Valia Efthymiou, Chara Podimata (MIT); Diptangshu Sen, Juba Ziani (Georgia Institute of Technology) |
| Inspect or Guess? Mechanism Design with Unobservable Inspection | Ali Daei Naby (Rotman School of Management, University of Toronto); Saeed Alaei (Google Research); azarakhsh malekian (Rotman School of Management, University of Toronto) |
| Dynamic public good provision without transfers | Nghia Pham (Caltech) |
| Learning to be Indifferent in Complex Decisions: A Coarse Q-learning Model | Aviman Satpathy (Paris School of Economics (PSE)); Philippe Jehiel (PSE & UCL) |
| Non-preferencing as a Fairness Provision: An Illustrated Guide | Andreas Haupt (Stanford) |
| Learning to Coordinate Bidders in Non-Truthful Auctions | Hu Fu (Shanghai University of Finance and Economics); Tao Lin (Harvard University) |
| Recommendation and Temptation | Sanzeed Anwar, Paramveer Dhillon, Grant Schoenebeck (University of Michigan) |
| No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints | Gagan Aggarwal (Google Research); Giannis Fikioris (Cornell University); Mingfei Zhao (Google Research) |
| WOMAC: A Mechanism to Combat Leaderboard Hacking | Siddarth (Srinivasan); Tao Lin (Harvard University); Connacher Murphy (Forecasting Research Institute); Anish Thilagar (University of Colorado Boulder); Yiling Chen (Harvard University); Ezra Karger (Federal Reserve Bank of Chicago) |
| A Dynamic Equilibrium Model of Automated Market Makers | Chengqi Zang (The University of Tokyo); Zhenghui Wang (The University of Adelaide); Weitong Zhang (Imperial College London) |
| Prophet Inequalities for Bandits, Cabinets, and DAGs | Elias Lindgren, Bo Waggoner, Robin Bowers (University of Colorado Boulder) |
| Gap Based Learning in First Price Auctions | Rigel Galgana (Massachusetts Institute of Technology); Negin Golrezaei (MIT) |
| Prophet Inequalities with Cancellation Costs | Farbod Ekbatani (University of Chicago Booth School of Business); Rad Niazadeh (The University of Chicago Booth School of Business); Pranav Nuti (University of Chicago); Jan Vondrak (Stanford University) |
| Multi-Task Dynamic Pricing in Credit Market with Contextual Information | Adel Javanmard (University of Southern California, Marshall School of Business); Jingwei Ji (University of Southern California); Renyuan Xu (New York University) |
| New Paradigms in Online Resource Allocation | Farbod Ekbatani (University of Chicago Booth School of Business); Rad Niazadeh (The University of Chicago Booth School of Business); Yiding Feng (Hong Kong University of Science and Technology); Ian Kash (UIC); Jan Vondrak, Pranav Nuti (Stanford) |
| Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade | Simone Di Gregorio (Sapienza University of Rome); Paul Duetting (Google); Federico Fusco (Sapienza University of Rome); Chris Schwiegelshohn (Aarhus University) |
| Fair division: Cakes, Graphs, Colors, and more | Paritosh Verma (Purdue) |
| An O(loglog n)-Approximation for Submodular Facility Location | Fateme Abbasi, Marek Adamczyk (University of Wrocław); Miguel Bosch-Calvo (IDSIA, USI-SUPSI); Jarosław Byrka (University of Wrocław); Fabrizio Grandoni (IDSIA, USI-SUPSI); Krzysztof Sornat (AGH University); Antoine Tinguely (IDSIA, USI-SUPSI) |
Tuesday Session:
| EconEvals: Benchmarks and Litmus Tests for LLM Agents in Unknown Environments | Sara Fish, Julia Shephard, Minkai Li (Harvard University); Ran Shorrer (Penn State University); Yannai Gonczarowski (Harvard University) |
| Contract Design for Sequential Actions | Michal Feldman (Tel Aviv University); Tomer Ezra (Harvard University); Maya Schlesinger (Tel Aviv University) |
| Combinatorial Selection with Costly Information | Shuchi Chawla, Dimitrios Christou (University of Texas at Austin); Amit Harlev, Ziv Scully (Cornell University) |
| Single-Sample and Robust Online Resource Allocation | Rohan Ghuge, Sahil Singla, Yifan Wang (Georgia Institute of Technology) |
| Optimally Auditing Adversarial Agents | Sanmay Das (Virginia Tech); Fang-Yi Yu, Yuang Zhang (George Mason University) |
| Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification | Chao Qin (Stanford University); Daniel Russo (Columbia University) |
| Repeated Sales with Heterogeneous Buyer Sophistication | (unaffiliated); Emmanouil Pountourakis (Drexel University); Sam Taggart (Oberlin College) |
| Statistical and online learning in the presence of improving agents | Dravyansh Sharma (Toyota Technological Institute at Chicago); Alec Sun (University of Chicago) |
| The Role of Prescreening in Auctions with Predictions | Yanwei Sun (Imperial College Business School); Fupeng Sun (Imperial College Busienss School); Chiwei Yan (University of California, Berkeley); Jiahua Wu (Imperial College London) |
| Trust-Aware Communication for Mechanism Design | Weitong Zhang (Imperial College London); Chengqi Zang (University of Tokyo); Mark Schmidt, Richard Blythman (Naptha AI) |
| Knapsack Contracts: Balancing Cost and Uncertainty in Multi-Agent Allocation | Asnat Berlin (Hebrew University); Ilan Reuven Cohen (Bar-Ilan University); Alon Eden (Hebrew University); Omri Porat, Inbal Talgam-Cohen (Tel Aviv University) |
| Information Design with Unknown Prior | Tao Lin (Harvard University); Ce Li (Boston University) |
| Greedy Algorithms for Dynamic Matching | Nick Arnosti, Felipe Simon (University of Minnesota) |
| Threshold scoring rules: A generalized decomposition for optimizing scoring rules with applications to decision-theoretic calibration error | Matthew vonAllmen, Jason Hartline (Northwestern University) |
| Games played on large networks: Equilibrium analysis, computation and learning | Kiran Rokade (Cornell University) |
| Polynomial-Time Approximation Schemes via Utility Alignment: Unit-demand Pricing and More | Robin Bowers (University of Colorado, Boulder); Marius Garbea, Emmanouil Pountourakis (Drexel University); Samuel Taggart (Oberlin College) |
| Online Fair Allocation with Best-of-Many-Worlds Guarantees | Zongjun Yang, Luofeng Liao, Yuan Gao, Christian Kroer (Columbia University) |
| User Altruism in Recommendation Systems | Ekaterina Fedorova, Madeline Kitch, Chara Podimata (MIT) |
| From Crowds to Codes: Minimizing Review Burden in Conference Review Protocols | Xingbo Wang (Peking University); Fang-Yi Yu (George Mason University); Yichi Zhang (Rutgers University) |
| Distributed Interview Selection when Matching in Large Random Markets | Richard Cole, Pranav Jangir (New York University) |
| Necessary and Sufficient Winners of Forecasting Competitions | Jens Witkowski (Frankfurt School of Finance & Management) |
| Proportional Selection in Networks | Georgios Papasotiropoulos, Oskar Skibski, Piotr Skowron (University of Warsaw); Tomasz Wąs (University of Oxford) |
Wednesday Session:
| Tracing Gendered Career Pipelines: A Computational Analysis of Occupational Segregation | Yuze Sui, Tianyu Du, Janet Xu (Stanford University) |
| Economic Representations | Suproteem Sarkar (Harvard University) |
| A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization | Shuchi Chawla, Dimitrios Christou, Trung Dang, Zhiyi Huang (University of Texas at Austin); Gregory Kehne (Washington University in Saint Louis); Rojin Rezvan (University of Texas at Austin) |
| Proportionally Fair Makespan Approximation | Jugal Garg (University of Illinois at Urbana-Champaign); Michal Feldman (Tel Aviv University); Vishnu V. Narayan (University of Illinois at Urbana-Champaign); Tomasz Ponitka (Tel Aviv University) |
| Choosing the Better Bandit Algorithm under Data Sharing: When Do A/B Experiments Work? | Shuangning Li (University of Chicago); Chonghuan Wang (MIT); Jingyan Wang (Georgia Institute of Technology) |
| Persuasion Gains and Losses from Peer Communication | Toygar T. Kerman, Anastas P. Tenev (Institute of Economics, Corvinus University of Budapest); Konstantin Zabarnyi (Yale University) |
| Stationary Online Contention Resolution Schemes | Mohammad Reza Aminian, Rad Niazadeh (The University of Chicago Booth School of Business); Pranav Nuti (Stanford) |
| Persuasive Calibration | Yiding Feng (Hong Kong University of Science and Technology); Wei Tang (Chinese University of Hong Kong) |
| On the Existence and Computation of Discrete Fair Allocations | Vishwa Prakash HV (Chennai Mathematical Institute) |
| The Value of Recall in Extensive-Form Games | Ratip Emin Berker, Emanuel Tewolde, Ioannis Anagnostides, Tuomas Sandholm, Vincent Conitzer (Carnegie Mellon University) |
| Public Projects with Preferences and Predictions | Mary Monroe, Bo Waggoner (University of Colorado Boulder) |
| Toward High-Quality Feedback from Humans and AIs: A Peer Prediction Point of View | Yichi Zhang (DIMACS, Rutgers University) |
| Benchmarking LLMs’ Judgments with No Gold Standard | Shengwei Xu (University of Michigan); Yuxuan Lu (Peking University); Grant Schoenebeck (University of Michigan); Yuqing Kong (Peking University) |
| Strategic formation of collaborative networks | Philip Solimine (University of British Columbia); Luke Boosey (Florida State University) |
| Learning from a Mixture of Information Sources | Nicole Immorlica (Microsoft); Brendan Lucier, Clayton Thomas (Microsoft Research); Ruqing Xu (Cornell University) |
| Who’s Heard and Who Decides?: Strategic Incentives in Model-Driven Social Evaluation | David Gamba, Seura Ha, Daniel M. Romero, Grant Schoenebeck (University of Michigan) |
| Matching and Pricing on a Tree | Thanawat Sornwanee (Stanford University) |
| Data Reliability Scoring | Fang-Yi Yu (George Mason), Shi Feng, Yiling Chen (Harvard) |
| Aligning Language Models with Observational Data: Opportunities and Risks from a Causal Perspective | Erfan Loghmani (U Washington) |
| Polynomial Sample Complexity for Blackbox Reductions in Mechanism Design with Additive Bidders | Arya Maheshwari, Matt Weinberg, Eric Xue (Princeton) |
| Finite-Sample Guarantees for Best-Response Learning Dynamics in Zero-Sum Matrix Games | Fathima Zarin Faizal, Asuman Ozdaglar, Martin J. Wainwright (MIT) |
| Experimental Site Selection Under Distribution Shift via Optimal Transport | Adam Bouyamourn (UC Berkeley) |
| LABOR-LLM: Language-Based Occupational Representations with Large Language Models | Susan Athey (Stanford Unversity); Herman Brunborg, Tianyu Du, Ayush Kanodia (Stanford University); Keyon Vafa (Harvard Data Science Initiative) |