Optimal Envy-Free Cake Cutting

We consider the problem of fairly dividing a heterogeneous divisible good among agents with different preferences. Previous work has shown that envy-free allocations, i.e., where each agent prefers its own allocation to any other, may not be efficient, in the sense of maximizing the total value of the agents. Our goal is to pinpoint the most efficient allocations among all envy-free allocations. We provide tractable algorithms for doing so under different assumptions regarding the preferences of the agents.

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

[2]  Hans Reijnierse,et al.  On finding an envy-free Pareto-optimal division , 1998, Math. Program..

[3]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

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

[5]  Steven J. Brams,et al.  Proportional pie-cutting , 2008, Int. J. Game Theory.

[6]  Steven J. Brams,et al.  Two-Person Pie-Cutting: The Fairest Cuts , 2010 .

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

[8]  K. Pruhs,et al.  Cake cutting really is not a piece of cake , 2006, SODA 2006.

[9]  Moshe Tennenholtz,et al.  Approximate mechanism design without money , 2009, EC '09.

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

[11]  Michael A. Jones.  Equitable, Envy-free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods , 2002 .

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

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

[14]  D. Weller,et al.  Fair division of a measurable space , 1985 .

[15]  S. Brams,et al.  Better Ways to Cut a Cake , 2006 .

[16]  Nikhil R. Devanur,et al.  Market equilibrium via a primal-dual-type algorithm , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[17]  Kurt Mehlhorn,et al.  Optimal search for rationals , 2003, Inf. Process. Lett..

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

[19]  Jack M. Robertson,et al.  Near Exact and Envy Free Cake Division , 1997, Ars Comb..

[20]  Elchanan Mossel,et al.  Truthful Fair Division , 2010, SAGT.

[21]  H. Steinhaus,et al.  Sur la division pragmatique , 1949 .

[22]  E. Eisenberg,et al.  CONSENSUS OF SUBJECTIVE PROBABILITIES: THE PARI-MUTUEL METHOD, , 1959 .

[23]  Christos H. Papadimitriou.  Efficient Search for Rationals , 1979, Inf. Process. Lett..

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

[25]  W. Thomson.  Children Crying at Birthday Parties. Why? , 2007 .

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

[27]  Oleg Pikhurko.  On Envy-Free Cake Division , 2000, Am. Math. Mon..

[28]  Sandip Sen,et al.  Improving Optimality of n Agent Envy-Free Divisions , 2001, ATAL.

[29]  A. K. Austin,et al.  Sharing a Cake , 1982, The Mathematical Gazette.

[30]  Gerhard J. Woeginger,et al.  A Lower Bound for Cake Cutting , 2003, ESA.

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

[32]  W. Thomson,et al.  On the fair division of a heterogeneous commodity , 1992 .

[33]  Douglas R. Woodall,et al.  A note on the cake-division problem , 1986, J. Comb. Theory, Ser. A.

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

[35]  Douglas R. Woodall,et al.  Dividing a cake fairly , 1980 .

[36]  Kent E. Morrison,et al.  Cutting Cakes Carefully , 2010 .

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

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

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

[40]  Steven J. Brams,et al.  Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond , 2004, Math. Soc. Sci..

[41]  Miroslav Dudík,et al.  Reducing Untruthful Manipulation in Envy-Free Pareto Optimal Resource Allocation , 2010, 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[42]  Tatsuaki Okamoto,et al.  Meta-Envy-Free Cake-Cutting Protocols , 2010, MFCS.