When Can the Maximin Share Guarantee Be Guaranteed?

The fairness notion of maximin share (MMS) guarantee underlies a deployed algorithm for allocating indivisible goods under additive valuations. Our goal is to understand when we can expect to be able to give each player his MMS guarantee. Previous work has shown that such an MMS allocation may not exist, but the counterexample requires a number of goods that is exponential in the number of players; we give a new construction that uses only a linear number of goods. On the positive side, we formalize the intuition that these counterexamples are very delicate by designing an algorithm that provably finds an MMS allocation with high probability when valuations are drawn at random.

[1]  Ariel D. Procaccia,et al.  Truth, justice, and cake cutting , 2010, Games Econ. Behav..

[2]  Simina Brânzei,et al.  Simultaneous Cake Cutting , 2014, AAAI.

[3]  Béla Bollobás,et al.  Random Graphs , 1985 .

[4]  Simina Brânzei,et al.  A Dictatorship Theorem for Cake Cutting , 2015, IJCAI.

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

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

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

[8]  Ariel D. Procaccia,et al.  On Maxsum Fair Cake Divisions , 2012, AAAI.

[9]  Ariel D. Procaccia,et al.  How to Cut a Cake Before the Party Ends , 2013, AAAI.

[10]  Toby Walsh,et al.  Fair assignment of indivisible objects under ordinal preferences , 2013, AAMAS.

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

[12]  Ariel D. Procaccia,et al.  Envy-Free Division of Sellable Goods , 2014, AAAI.

[13]  Ariel D. Procaccia,et al.  Optimal Envy-Free Cake Cutting , 2011, AAAI.

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

[15]  Felix Schlenk,et al.  Proof of Theorem 2 , 2005 .

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

[17]  Jérôme Lang,et al.  Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity , 2005, IJCAI.

[18]  Qiang Zhang,et al.  Truthful Cake Cutting Mechanisms with Externalities: Do Not Make Them Care for Others Too Much! , 2015, IJCAI.

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

[20]  C. McDiarmid.  Clutter percolation and random graphs , 1980 .

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

[22]  Ning Chen,et al.  Optimal Proportional Cake Cutting with Connected Pieces , 2012, AAAI.

[23]  Avinatan Hassidim,et al.  Computing socially-efficient cake divisions , 2012, AAMAS.

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

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

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

[27]  Jörg Rothe,et al.  Complexity of social welfare optimization in multiagent resource allocation , 2010, AAMAS.

[28]  Simina Brânzei,et al.  Equilibrium analysis in cake cutting , 2013, AAMAS.