| 2021 | Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games. | Paul W. Goldberg, Matthew J. Katzman |
| 2021 | Prior-Free Clock Auctions for Bidders with Interdependent Values. | Vasilis Gkatzelis, Rishi Patel, Emmanouil Pountourakis, Daniel Schoepflin |
| 2021 | Approximate Competitive Equilibrium with Generic Budget. | Amin Ghiasi, Masoud Seddighin |
| 2021 | Vote Delegation and Misbehavior. | Hans Gersbach, Akaki Mamageishvili, Manvir Schneider |
| 2021 | Computing Fair and Efficient Allocations with Few Utility Values. | Jugal Garg, Aniket Murhekar |
| 2021 | When Dividing Mixed Manna Is Easier Than Dividing Goods: Competitive Equilibria with a Constant Number of Chores. | Jugal Garg, Martin Hoefer, Peter McGlaughlin, Marco Schmalhofer |
| 2021 | Approximate Mechanism Design for Distributed Facility Location. | Aris Filos-Ratsikas, Alexandros A. Voudouris |
| 2021 | Prophet Inequality with Competing Agents. | Tomer Ezra, Michal Feldman, Ron Kupfer |
| 2021 | Optimal Revenue Guarantees for Pricing in Large Markets. | Jos Correa, Dana Pizarro, Victor Verdugo |
| 2021 | On Tightness of the Tsaknakis-Spirakis Algorithm for Approximate Nash Equilibrium. | Zhaohua Chen, Xiaotie Deng, Wenhan Huang, Hanyu Li, Yuhao Li |
| 2021 | On (Coalitional) Exchange-Stable Matching. | Jiehua Chen, Adrian Chmurovic, Fabian Jogl, Manuel Sorge |
| 2021 | On Submodular Prophet Inequalities and Correlation Gap. | Chandra Chekuri, Vasilis Livanos |
| 2021 | Hedonic Expertise Games. | Bugra askurlu, Fatih Erdem Kizilkaya, Berkehan Ozen |
| 2021 | On Reward Sharing in Blockchain Mining Pools. | Burak Can, Jens Leth Hougaard, Mohsen Pourpouneh |
| 2021 | Metric-Distortion Bounds Under Limited Information. | Ioannis Anagnostides, Dimitris Fotakis, Panagiotis Patsilinakos |
| 2021 | Auctions with Interdependence and SOS: Improved Approximation. | Ameer Amer, Inbal Talgam-Cohen |
| 2021 | Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming. | Mete Seref Ahunbay, Adrian Vetta |
| 2021 | The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential Auctions. | Mete Seref Ahunbay, Brendan Lucier, Adrian Vetta |
| 2020 | How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces. | Mashbat Suzuki, Adrian Vetta |
| 2020 | Price of Anarchy in Congestion Games with Altruistic/Spiteful Players. | Marc Schrder |
| 2020 | Race Scheduling Games. | Shaul Rosner, Tami Tamir |
| 2020 | Dynamic Equilibria in Time-Varying Networks. | Hoang Minh Pham, Leon Sering |
| 2020 | Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms. | Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar |
| 2020 | A General Framework for Computing the Nucleolus via Dynamic Programming. | Jochen Knemann, Justin Toth |
| 2020 | Approximating Stable Matchings with Ties of Bounded Size. | Jochen Knemann, Kanstantsin Pashkovich, Natig Tofigzade |