Yannai A. Gonczarowski

Select Recent Economics Working Papers

Scientific Publications and Working Papers (Economics and Computer Science)

Year Title Co-Authors Published in Latest Version Presentation
2025 Zero-Knowledge Mechanisms Ran Canetti and Amos Fiat Abstract: Proceedings of the 26th ACM Conference on Economics and Computation (EC 2025), pp. 338–339
Working paper: available on arXiv.org 		60-min:
Stable Menus of Public Goods: A Matching Problem Sara Fish and Sergiu Hart Abstract: Proceedings of the 26th ACM Conference on Economics and Computation (EC 2025), p. 348
Full paper: available on arXiv.org
EconEvals: Benchmarks and Litmus Tests for LLM Agents in Unknown Environments Sara Fish, Julia Shephard, Minkai Li, and Ran I. Shorrer Working paper available on arXiv.org [Github]
2024 Quantifying Inefficiency Ella Segev Working paper available on arXiv.org
Common Knowledge, Regained Yoram Moses Abstract: Proceedings of the 25th ACM Conference on Economics and Computation (EC 2024), p. 208
Working paper: available on arXiv.org 		20-min:
Describing Deferred Acceptance and Strategyproofness to Participants: Experimental Analysis Ori Heffetz, Guy Ishai, and Clayton Thomas Abstract: Proceedings of the 25th ACM Conference on Economics and Computation (EC 2024), pp. 416–417
Working paper: available on arXiv.org [Online experimental materials] 		60-min:
Disrupting Bipartite Trading Networks: Matching for Revenue Maximization Luca D'Amico-Wong, Gary Qiurui Ma, and David C. Parkes Abstract: Proceedings of the 25th ACM Conference on Economics and Computation (EC 2024), pp. 545–546
Full paper: available on arXiv.org
Algorithmic Collusion by Large Language Models Sara Fish and Ran I. Shorrer Working paper available on arXiv.org 30-min:
Multi-District School Choice: Playing on Several Fields Michael Yin and Shirley Zhang Working paper available on arXiv.org
Structural Complexities of Matching Mechanisms Clayton Thomas Extended abstract: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC 2024), pp. 455–466
Full paper: available on arXiv.org
Revenue Maximization for Buyers with Costly Participation Nicole Immorlica, Yingkai Li, and Brendan Lucier Extended abstract: Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2024), pp. 41–73.
Full paper: available on arXiv.org
2023 The Distortion of Binomial Voting Defies Expectation Gregory Kehne, Ariel D. Procaccia, Ben Schiffer, and Shirley Zhang Extended abstract: Proceedings of the 37th Annual Conference on Neural Information Processing Systems (NeurIPS 2023)
Full paper: available on arXiv.org
Strategyproofness-Exposing Mechanism Descriptions Ori Heffetz and Clayton Thomas Abstract: Proceedings of the 24th ACM Conference on Economics and Computation (EC 2023), p. 782
Working paper: NBER Working Paper 31506 [Online experimental materials] 		30-min:
2020 Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer Moshe Babaioff, Michal Feldman, Brendan Lucier, and Inbal Talgam-Cohen Abstract: Proceedings of the 21st ACM Conference on Economics and Computation (EC 2020), p. 191. Best Flash Video Award
Full paper: available on arXiv.org 		🗲1-min:
12-min:
To Infinity and Beyond: A General Framework for Scaling Economic Theories Scott Duke Kominers and Ran I. Shorrer Abstract: Proceedings of the 21st ACM Conference on Economics and Computation (EC 2020), p. 353. Honorable Mention for Best Presentation by a Student or Postdoctoral Researcher
Full paper: Theoretical Economics, 20(2):511–542, 2025 		🗲1-min:
20-min:
60-min:
The Complexity of Interactively Learning a Stable Matching by Trial and Error Ehsan Emamjomeh-Zadeh and David Kempe Abstract: Proceedings of the 21st ACM Conference on Economics and Computation (EC 2020), p. 599
Full paper: available on arXiv.org 		🗲1-min:
20-min:
Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets Moshe Babaioff and Kira Goldner Extended Abstract: Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), pp. 2452–2471
Full paper: available on arXiv.org 		60-min:
2019 Matching for the Israeli "Mechinot" Gap-Year Programs: Handling Rich Diversity Requirements Lior Kovalio, Noam Nisan, and Assaf Romm Abstract: Proceedings of the 20th ACM Conference on Economics and Computation (EC 2019), p. 321
Full paper: available on arXiv.org
Best Paper Award at MATCH-UP 2019, the 5th International Workshop on Matching Under Preferences
INFORMS AMD Michael H. Rothkopf Junior Researcher Paper Prize (first place) for 2020 		20-min:
Playing on a Level Field: Sincere and Sophisticated Players in the Boston Mechanism with a Coarse Priority Structure Moshe Babaioff and Assaf Romm Abstract: Proceedings of the 20th ACM Conference on Economics and Computation (EC 2019), p. 345
Full paper: available on arXiv.org 		20-min:
2018 The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization S. Matthew Weinberg Extended Abstract: Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018), pp. 416–426
Full paper: Journal of the ACM, 68(3):#15 (28pp), 2021 		20-min:
Stable Matching Mechanisms are Not Obviously Strategy-Proof Itai Ashlagi Journal of Economic Theory, 177:405–425
Bounding the Menu-Size of Approximately Optimal Auctions via Optimal-Transport Duality Extended Abstract: Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC 2018), pp. 123–131
Full paper: available on arXiv.org 		20-min:
60-min:
Are Two (Samples) Really Better Than One? On the Non-Asymptotic Performance of Empirical Revenue Maximization Moshe Babaioff, Yishay Mansour, and Shay Moran Abstract: Proceedings of the 19th ACM Conference on Economics and Computation (EC 2018), p. 175. Award for Best Presentation by a Student or Postdoctoral Researcher
Full paper: available on arXiv.org 		20-min:
The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Guarantee on the Expected Gains-From-Trade Moshe Babaioff, Yang Cai, and Mingfei Zhao Abstract: Proceedings of the 19th ACM Conference on Economics and Computation (EC 2018), p. 373
Full paper: available on arXiv.org 		20-min:
2017 Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues Noga Alon, Moshe Babaioff, Yishay Mansour, Shay Moran, and Amir Yehudayoff Extended Abstract: Proceedings of the 31st Annual Conference on Neural Information Processing Systems (NeurIPS 2017), pp. 1656–1665. Selected for a Spotlight Presentation, along with 3.5% of submissions
Full paper: available on arXiv.org 		🗲3-min:
Gibbard-Satterthwaite Success Stories and Obvious Strategyproofness Sophie Bade Abstract: Proceedings of the 18th ACM Conference on Economics and Computation (EC 2017), p. 565
Full paper: Hebrew University of Jerusalem Center for the Study of Rationality Discussion Paper 704 (2016) 		20-min:
Efficient Empirical Revenue Maximization in Single-Parameter Auction Environments Noam Nisan Extended Abstract: Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC 2017), pp. 856–868
Full paper: available on arXiv.org 		20-min:
60-min:
The Menu-Size Complexity of Revenue Approximation Moshe Babaioff and Noam Nisan Extended Abstract: Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC 2017), pp. 869–877
Full paper: Games and Economic Behavior, 134:281–307, 2022 		15-min:
2016 A Hydraulic Approach to Equilibria of Resource Selection Games Moshe Tennenholtz Abstract: Proceedings of the 17th ACM Conference on Economics and Computation (EC 2016), p. 477
Full paper: Hebrew University of Jerusalem Center for the Study of Rationality Discussion Paper 673 (2014)
Unbeatable Set Consensus via Topological and Combinatorial Reasoning Armando Castañeda and Yoram Moses Extended Abstract: Proceedings of the 35th ACM Symposium on Principles of Distributed Computing (PODC 2016), pp. 107–116
Full paper: available on arXiv.org
2015 A Stable Marriage Requires Communication Noam Nisan, Rafail Ostrovsky, and Will Rosenbaum Extended Abstract: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 1003–1017
Full paper: Games and Economic Behavior, 118:626–647, 2019
2014 Unbeatable Consensus Armando Castañeda and Yoram Moses Extended Abstract: Proceedings of the 28th International Symposium on Distributed Computing (DISC 2014), pp. 91–106
Full paper: Distributed Computing, 35:123–143, 2022
Manipulation of Stable Matchings using Minimal Blacklists Abstract: Proceedings of the 15th ACM Conference on Economics and Computation (EC 2014), p. 449
Full paper: Hebrew University of Jerusalem Center for the Study of Rationality Discussion Paper 643 (2013) 		30-min:
Details:
A Mirage of Market Allocation Moshe Tennenholtz Hebrew University of Jerusalem Center for the Study of Rationality Discussion Paper 663
2013 "Secret Santa" and the Combined Length of Spanned Cycles in a Random Permutation Hebrew University of Jerusalem Center for the Study of Rationality Discussion Paper 650
Brief Announcement: Pareto Optimal Solutions to Concensus and Set Concensus Armando Castañeda and Yoram Moses Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 113–115
Sisterhood in the Gale-Shapley Matching Algorithm Ehud Friedgut The Electronic Journal of Combinatorics, 20(2):#P12 (18pp) Shorter:
Longer:
Timely Common Knowledge: Characterising Asymmetric Distributed Coordination via Vectorial Fixed Points Yoram Moses Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), pp. 79–93
2012 Timely Coordination in a Multi-Agent System
Thesis advisors:
Profs. Gil Kalai and Yoram Moses 		Master's thesis, The Hebrew University of Jerusalem, Israel