EC24 Tutorial: Share-based Fairness for Indivisible Items

This is an EC 2024 tutorial, it will take place virtually on Thursday, June 27, 2024, at 11am-1pm ET. 

In recent years, fair allocation of indivisible items has drawn significant research attention. The focus of this tutorial is on introducing the audience to recent progress in the research area of share-based fair allocation of indivisible items, both for equal entitlements and for arbitrary entitlements.

Everyone in the AGT community (both researchers and students) with basic knowledge in AGT. No assumptions will be made about prior knowledge regarding fair division.  

1. Part I (60 minutes)

   1. 1.  Introduction, motivation, basic ideas (15 minutes)

      2.  Share-based fairness for agents with equal entitlements (45 minutes)

2. Part II (60 minutes)

   1. 1.  Share-based fairness for agents with arbitrary entitlements (45 minutes)

      2. Conclusions, future directions, open problems (15 minutes)

Slides will be available after the tutorial will take place. 

David Kurokawa, Ariel D. Procaccia, and Junxing Wang. "Fair enough: Guaranteeing approximate maximin shares". J. ACM, 65(2):8:1–8:27, 2018.

Moshe Babaioff and Uriel Feige. "Fair Shares: Feasibility, Domination and Incentives". In ACM Conference on Economics and Computation (ACM-EC), 2022.

Moshe Babaioff and Uriel Feige. "Share-Based Fairness for Arbitrary Entitlements". 2024.

Moshe Babaioff, Tomer Ezra, and Uriel Feige. "Fair-share Allocations for Agents with Arbitrary Entitlements". In The ACM Conference on Economics and Computation (ACM-EC), 2021.

Eric Budish. "The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes". Journal of Political Economy, 119(6):1061–1103, 2011.

Moshe Babaioff, Noam Nisan, and Inbal Talgam-Cohen. "Competitive equilibrium with indivisible goods and generic budgets". Mathematics of Operations Research, 46(1):382–403, February 2021.

Moshe Babaioff, Tomer Ezra, and Uriel Feige. "On Best-of-Both-Worlds Fair-Share Allocations". In Web and Internet Economics (WINE), 2022.

Ioannis Caragiannis, Jugal Garg, Nidhi Rathi, Eklavya Sharma, Giovanna Varricchio: “New Fairness Concepts for Allocating Indivisible Items”. IJCAI 2023.

Yakov Babichenko, Michal Feldman, Ron Holzman, and Vishnu V. Narayan. "Fair division via quantile shares". ACM Symposium on Theory of Computing (STOC), 2024.

Steven J Brams and Alan D Taylor. “Fair Division: From cake-cutting to dispute resolution”. Cambridge University Press, 1996.

Herve Moulin. “Fair division and collective welfare”. MIT press, 2004.

Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, and Alexandros A. Voudouris. “Fair Division of Indivisible Goods: A Survey”. In The International Joint Conference on Artificial Intelligence - Survey Track (IJCAI), July 2022.

Haris Aziz, Bo Li, Herve Moulin, and Xiaowei Wu. “Algorithmic Fair Allocation of In-divisible Items: A Survey and New Questions”. SIGecom Exch., 20(1):24–40, November 2022.

Moshe Babaioff is an Associate Professor at the School of Computer Science and Engineering of the Hebrew University of Jerusalem. His research focuses on establishing rigorous theoretical foundations of solutions to real-world problems in the intersection of Economics and Computation (EC), using tools and approaches from Computer Science, Game Theory, and Microeconomic Theory.

Moshe has served on multiple leadership positions at the EC community, including serving as Program co-Chair of ACM-EC 2017, as General Chair of ACM-EC 2014, and as co-chair of the Economics, Monetization, and Online Markets Track of The Web Conference (2023).

Moshe has been a Researcher at Microsoft Research (MSR), first at MSR Silicon Valley lab (2007-2014) and then at MSR in Israel (2014-2023). Before joining MSR he was a postdoctoral scholar at the University of California, Berkeley. He received his PhD in Computer Science from the Hebrew University in Jerusalem.

Uriel Feige is a professor at the Department of Computer Science and Applied Mathematics of the Weizmann Institute of Science. He also earned his Phd there. He conducted postdoctoral research at Princeton University and at the IBM T.J. Watson Research Center, and spent a sabbatical at the Compaq Systems Research Center. In 2004-2007, he took leave from the Weizmann Institute to work with Microsoft Research’s Theory Group, and he later served as a part time consultant at Microsoft Research, Israel. His main research areas are algorithms, computational complexity, algorithmic game theory, with a recent focus on fair allocations. He served as Program Committee Chair for STOC (2007) and ICALP (2023, Track A). His work was recognized by some awards, including a Godel Award (2001), a SIAM Outstanding Paper Prize (2005), and a FOCS test of time award (2021).