| 2022 | Complexity of Public Goods Games on Graphs. | Matan Gilboa, Noam Nisan |
| 2022 | Lookahead Auctions with Pooling. | Michal Feldman, Nick Gravin, Zhihao Gavin Tang, Almog Wald |
| 2022 | Fairness in Temporal Slot Assignment. | Edith Elkind, Sonja Kraiczy, Nicholas Teh |
| 2022 | Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy. | Edith Elkind, Abheek Ghosh, Paul W. Goldberg |
| 2022 | Justifying Groups in Multiwinner Approval Voting. | Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong |
| 2022 | Collective Schedules: Axioms and Algorithms. | Martin Durand, Fanny Pascual |
| 2022 | An Improved Bound for the Tree Conjecture in Network Creation Games. | Jack Dippel, Adrian Vetta |
| 2022 | Learning Approximately Optimal Contracts. | Alon Cohen, Argyrios Deligkas, Moran Koren |
| 2022 | Greater Flexibility in Mechanism Design Through Altruism. | Ruben Brokkelkamp, Sjir Hoeijmakers, Guido Schfer |
| 2022 | How Bad is the Merger Paradox? | Liad Blumrosen, Yehonatan Mizrahi |
| 2022 | Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. | Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana |
| 2022 | Fair Ride Allocation on a Line. | Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono |
| 2022 | Decentralized Update Selection with Semi-strategic Experts. | Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco J. Marmolejo Cosso |
| 2021 | Incentive Compatible Mechanism for Influential Agent Selection. | Xiuzhen Zhang, Yao Zhang, Dengji Zhao |
| 2021 | Efficiency of Equilibria in Games with Random Payoffs. | Matteo Quattropani, Marco Scarsini |
| 2021 | Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees. | Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta |
| 2021 | Pure Nash Equilibria in a Generalization of Congestion Games Allowing Resource Failures. | Julian Nickerl, Jacobo Torn |
| 2021 | Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality? | Ndiam Ndiaye, Sergey Norin, Adrian Vetta |
| 2021 | Two Birds with One Stone: Fairness and Welfare via Transfers. | Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta |
| 2021 | The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences. | Michael McKay, David F. Manlove |
| 2021 | An Approval-Based Model for Single-Step Liquid Democracy. | Evangelos Markakis, Georgios Papasotiropoulos |
| 2021 | On the Complexity of Nucleolus Computation for Bipartite b-Matching Games. | Jochen Knemann, Justin Toth, Felix Zhou |
| 2021 | Game Theory on the Blockchain: A Model for Games with Smart Contracts. | Mathias Hall-Andersen, Nikolaj I. Schwartzbach |
| 2021 | Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. | Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh |
| 2021 | Cost Sharing in Two-Sided Markets. | Sreenivas Gollapudi, Kostas Kollias, Ali Shameli |