Fair enough: guaranteeing approximate maximin shares

We consider the problem of fairly allocating indivisible goods, focusing on a recently introduced notion of fairness called maximin share guarantee: each player’s value for his allocation should be at least as high as what he can guarantee by dividing the items into as many bundles as there are players and receiving his least desirable bundle. Assuming additive valuation functions, we show that such allocations may not exist, but allocations guaranteeing each player 2/3 of the above value always exist. These theoretical results have direct practical implications.

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

[2]  Ivona Bezáková,et al.  Allocating indivisible goods , 2005, SECO.

[3]  Theodore P. Hill,et al.  Partitioning General Probability Measures , 1987 .

[4]  Geoffroy de Clippel,et al.  Impartial division of a dollar , 2008, J. Econ. Theory.

[5]  Tayfun Sönmez,et al.  Room assignment-rent division: A market approach , 2004, Soc. Choice Welf..

[6]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[7]  Ariel D. Procaccia,et al.  No agent left behind: dynamic fair division of multiple resources , 2013, AAMAS.

[8]  Benjamin Hindman,et al.  Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , 2011, NSDI.

[9]  Ariel D. Procaccia,et al.  Cake cutting: not just child's play , 2013, CACM.

[10]  Eric Budish.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2011, Journal of Political Economy.

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

[12]  Elisha A. Pazner,et al.  Egalitarian Equivalent Allocations: A New Concept of Economic Equity , 1978 .

[13]  Dan Suciu,et al.  Journal of the ACM , 2006 .

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

[15]  Kirk Pruhs,et al.  Balanced Allocations of Cake , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

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

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

[18]  Costas Busch,et al.  Cake-Cutting Is Not a Piece of Cake , 2003, STACS.

[19]  C ParkesDavid,et al.  Beyond Dominant Resource Fairness , 2015 .

[20]  Ariel D. Procaccia,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.

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

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

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

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

[25]  Kurt Mehlhorn,et al.  On Fair Division for Indivisible Items , 2018, FSTTCS.

[26]  Gerhard J. Woeginger,et al.  On the complexity of cake cutting , 2007, Discret. Optim..

[27]  Ariel D. Procaccia.  Thou Shalt Covet Thy Neighbor's Cake , 2009, IJCAI.

[28]  Ioannis Caragiannis,et al.  The Efficiency of Fair Division , 2009, Theory of Computing Systems.

[29]  Ariel D. Procaccia,et al.  Beyond Dominant Resource Fairness , 2015, ACM Trans. Economics and Comput..

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

[31]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[32]  Amin Saberi,et al.  An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.

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

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

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

[36]  Evangelos Markakis,et al.  On Worst-Case Allocations in the Presence of Indivisible Goods , 2011, WINE.

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

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