Approximate maximin shares for groups of agents

We investigate the problem of fairly allocating indivisible goods among interested agents using the concept of maximin share. Procaccia and Wang showed that while an allocation that gives every agent at least her maximin share does not necessarily exist, one that gives every agent at least $2/3$ of her share always does. In this paper, we consider the more general setting where we allocate the goods to groups of agents. The agents in each group share the same set of goods even though they may have conflicting preferences. For two groups, we characterize the cardinality of the groups for which a constant factor approximation of the maximin share is possible regardless of the number of goods. We also show settings where an approximation is possible or impossible when there are several groups.

[1]  Evangelos Markakis,et al.  Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness , 2017, EC.

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

[3]  Warut Suksompong.  Assigning a Small Agreeable Set of Indivisible Items to Multiple Players , 2016, IJCAI.

[4]  Peter C. Fishburn,et al.  Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity , 2000, Soc. Choice Welf..

[5]  H. Varian.  Equity, Envy and Efficiency , 1974 .

[6]  Siddharth Barman,et al.  Approximation Algorithms for Maximin Fair Division , 2017, EC.

[7]  Steven J. Brams,et al.  Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm , 2013 .

[8]  Pasin Manurangsi,et al.  Computing an Approximately Optimal Agreeable Set of Items , 2017, International Joint Conference on Artificial Intelligence.

[9]  Sylvain Bouveret,et al.  Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.

[10]  D. Foley.  Resource allocation and the public sector , 1967 .

[11]  Warut Suksompong,et al.  Asymptotic existence of proportionally fair allocations , 2016, Math. Soc. Sci..

[12]  H. Moulin.  Uniform externalities: Two axioms for fair allocation , 1990 .

[13]  Mohammad Ghodsi,et al.  Fair Allocation of Indivisible Goods: Improvements and Generalizations , 2017, EC.

[14]  Eric Budish,et al.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.

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

[16]  Evangelos Markakis,et al.  Approximation Algorithms for Computing Maximin Share Allocations , 2015, ICALP.

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

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

[19]  Gerhard J. Woeginger,et al.  A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..

[20]  Jérôme Monnot,et al.  Approximate Maximin Share Allocations in Matroids , 2017, CIAC.

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

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

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

[24]  Steven J. Brams,et al.  The undercut procedure: an algorithm for the envy-free division of indivisible items , 2009, Soc. Choice Welf..

[25]  Ariel D. Procaccia,et al.  The Computational Rise and Fall of Fairness , 2014, AAAI.

[26]  Ariel D. Procaccia,et al.  When Can the Maximin Share Guarantee Be Guaranteed? , 2016, AAAI.

[27]  Evangelos Markakis,et al.  On Truthful Mechanisms for Maximin Share Allocations , 2016, IJCAI.