Constraints in fair division

The fair allocation of resources to interested agents is a fundamental problem in society. While the majority of the fair division literature assumes that all allocations are feasible, in practice there are often constraints on the allocation that can be chosen. In this survey, we discuss fairness guarantees for both divisible (cake cutting) and indivisible resources under several common types of constraints, including connectivity, cardinality, matroid, geometric, separation, budget, and conflict constraints. We also outline a number of open questions and directions.

[1]  Adrian Vetta,et al.  The Fair Division of Hereditary Set Systems , 2018, WINE.

[2]  Martin Milanic,et al.  Fair Packing of Independent Sets , 2020, IWOCA.

[3]  Siddharth Barman,et al.  Fair and Efficient Cake Division with Connected Pieces , 2019, WINE.

[4]  Yann Chevaleyre,et al.  Fair Allocation of Indivisible Goods , 2016, Handbook of Computational Social Choice.

[5]  Simina Brânzei,et al.  The Query Complexity of Cake Cutting , 2017, NeurIPS.

[6]  Xiaotie Deng,et al.  Algorithmic Solutions for Envy-Free Cake Cutting , 2012, Oper. Res..

[7]  Xiaohui Bei,et al.  Connected Fair Allocation of Indivisible Goods , 2019, ArXiv.

[8]  Jérôme Monnot,et al.  On maximin share allocations in matroids , 2019, Theor. Comput. Sci..

[9]  Warut Suksompong,et al.  Fairly Allocating Contiguous Blocks of Indivisible Items , 2017, SAGT.

[10]  Ariel D. Procaccia,et al.  Spliddit: unleashing fair division algorithms , 2015, SECO.

[11]  William Thomson,et al.  Introduction to the Theory of Fair Allocation , 2016, Handbook of Computational Social Choice.

[12]  Steven J. Brams,et al.  Fair division - from cake-cutting to dispute resolution , 1998 .

[13]  Erel Segal-Halevi,et al.  Envy-Free Division of Land , 2016, Math. Oper. Res..

[14]  Edith Elkind,et al.  Keep Your Distance: Land Division With Separation , 2021, IJCAI.

[15]  Rade T. Zivaljevic,et al.  Splitting Necklaces, with Constraints , 2019, SIAM J. Discret. Math..

[16]  Hervé Moulin,et al.  Competitive Division of a Mixed Manna , 2017, ArXiv.

[17]  Katarína Cechlárová,et al.  Chore division on a graph , 2018, Autonomous Agents and Multi-Agent Systems.

[18]  Toby Walsh.  Fair Division: The Computer Scientist's Perspective , 2020, ArXiv.

[19]  Lester E. Dubins,et al.  How to Cut a Cake Fairly , 1961 .

[20]  Erel Segal-Halevi,et al.  On Fair Division under Heterogeneous Matroid Constraints , 2020, AAAI.

[21]  Magnus Lie Hetland,et al.  Guaranteeing Half-Maximin Shares Under Cardinality Constraints , 2022, AAMAS.

[22]  Tamás Fleiner,et al.  The Complexity of Cake Cutting with Unequal Shares , 2020, ACM Trans. Algorithms.

[23]  Siddharth Barman,et al.  Fair Division Under Cardinality Constraints , 2018, IJCAI.

[24]  Edith Elkind,et al.  Graphical Cake Cutting via Maximin Share , 2021, IJCAI.

[25]  Miroslaw Truszczynski,et al.  Maximin Share Allocations on Cycles , 2020, J. Artif. Intell. Res..

[26]  Pasin Manurangsi,et al.  Asymptotic existence of fair divisions for groups , 2017, Math. Soc. Sci..

[27]  Magnus Lie Hetland,et al.  Fair Allocation of Conflicting Items , 2022, Auton. Agents Multi Agent Syst..

[28]  Hervé Moulin,et al.  Fair division and collective welfare , 2003 .

[29]  W. Stromquist.  How to Cut a Cake Fairly , 1980 .

[30]  Xiaohui Bei,et al.  Dividing a Graphical Cake , 2019, AAAI.

[31]  Ayumi Igarashi,et al.  Envy-free division of multi-layered cakes , 2021, WINE.

[32]  Yair Zick,et al.  On Weighted Envy-Freeness in Indivisible Item Allocation , 2020, AAMAS.

[33]  F. Su.  Rental Harmony: Sperner's Lemma in Fair Division , 1999 .

[34]  William S. Zwicker,et al.  Fair division of graphs and of tangled cakes , 2021, Mathematical Programming.

[35]  Jiarui Gan,et al.  Budget-feasible Maximum Nash Social Welfare Allocation is Almost Envy-free , 2020, ArXiv.

[36]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.

[37]  Erel Segal-Halevi,et al.  Fair multi-cake cutting , 2018, Discret. Appl. Math..

[38]  Ayumi Igarashi,et al.  Fair Division of Time: Multi-layered Cake Cutting , 2020, IJCAI.

[39]  Edith Elkind,et al.  Mind the Gap: Cake Cutting With Separation , 2021, AAAI.

[40]  Dominik Peters,et al.  Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints , 2018, AAAI.

[41]  Jiarui Gan,et al.  Approximately Envy-Free Budget-Feasible Allocation , 2021, ArXiv.

[42]  Xiaohui Bei,et al.  Fair Division of Mixed Divisible and Indivisible Goods , 2019 .

[43]  Erel Segal-Halevi,et al.  Envy-Free Cake-Cutting among Families , 2016, ArXiv.

[44]  Warut Suksompong,et al.  Approximate maximin shares for groups of agents , 2017, Math. Soc. Sci..

[45]  Shimon Even,et al.  A note on cake cutting , 1984, Discret. Appl. Math..

[46]  Edith Elkind,et al.  Fair Division of a Graph , 2017, IJCAI.

[47]  Jérôme Monnot,et al.  Near Fairness in Matroids , 2014, ECAI.

[48]  Rohit Vaish,et al.  Equitable Division of a Path , 2021, ArXiv.

[49]  Tamás Fleiner,et al.  The Complexity of Cake Cutting with Unequal Shares , 2017, SAGT.

[50]  Warut Suksompong,et al.  Almost envy-freeness in group resource allocation , 2020, Theor. Comput. Sci..

[51]  Vittorio Bilò,et al.  Almost Envy-Free Allocations with Connected Bundles , 2018, ITCS.

[52]  Ragavendran Gopalakrishnan,et al.  The Price of Indivisibility in Cake Cutting , 2018, ArXiv.

[53]  Paul W. Goldberg,et al.  Contiguous Cake Cutting: Hardness Results and Approximation Algorithms , 2019, AAAI.

[54]  Erel Segal-Halevi,et al.  Fair and Square: Cake-Cutting in Two Dimensions , 2014, ArXiv.

[55]  Jack M. Robertson,et al.  Cake-cutting algorithms - be fair if you can , 1998 .

[56]  E. Markakis.  Approximation Algorithms and Hardness Results for Fair Division with Indivisible Goods , 2017 .

[57]  Ariel D. Procaccia.  Cake Cutting Algorithms , 2016, Handbook of Computational Social Choice.

[58]  Erel Segal-Halevi,et al.  Fairly Dividing a Cake after Some Parts Were Burnt in the Oven , 2017, AAMAS.

[59]  Kurt Mehlhorn,et al.  Assigning Papers to Referees , 2009, Algorithmica.

[60]  Moshe Babaioff,et al.  Competitive Equilibria with Indivisible Goods and Generic Budgets , 2017, Math. Oper. Res..

[61]  Erel Segal-Halevi,et al.  Proportional Cake-Cutting among Families , 2015, 1510.03903.

[62]  Paul W. Goldberg,et al.  Contiguous Cake Cutting: Hardness Results and Approximation Algorithms , 2020, J. Artif. Intell. Res..

[63]  Toby Walsh,et al.  Fair allocation of indivisible goods and chores , 2019, Autonomous Agents and Multi-Agent Systems.

[64]  Mohammad Taghi Hajiaghayi,et al.  Fair Allocation of Indivisible Goods to Asymmetric Agents , 2017, AAMAS.

[66]  Ariel D. Procaccia,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2019, ACM Trans. Economics and Comput..

[67]  Walter Stromquist,et al.  Envy-Free Cake Divisions Cannot be Found by Finite Protocols , 2008, Electron. J. Comb..

[68]  Xiaohui Bei,et al.  Fair Division of Mixed Divisible and Indivisible Goods , 2019, AAAI.

[69]  Haris Aziz,et al.  A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).