The Efficiency of Fair Division with Connected Pieces

The cake-cutting setting, in which a single heterogeneous good must be divided between multiple parties with different tastes, is a classic model for studying questions regarding fairness in resource allocation. In this work, we turn our attention to (economic) efficiency considerations in cake cutting, examining the possible trade-offs between meeting the fairness criteria, on the one hand, and maximizing social welfare, on the other. We focus on divisions that give each agent a single (contiguous) piece of the cake and provide tight bounds (or, in some cases, nearly tight) on the possible degradation in utilitarian and egalitarian welfare resulting from meeting the fairness requirements.

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

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

[3]  Edward M. Reingold,et al.  Mathematical entertainments , 2000 .

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

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

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

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

[8]  Yonatan Aumann,et al.  Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games , 2010, SAGT.

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

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

[11]  Alan D. Taylor,et al.  A paradoxical Pareto frontier in the cake-cutting context , 2005, Math. Soc. Sci..

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

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

[14]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[15]  Christopher P. Chambers.  Allocation rules for land division , 2005, J. Econ. Theory.

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

[17]  Massimo Marinacci,et al.  APPLIED MATHEMATICS WORKING PAPER SERIESHOW TO CUT A PIZZA FAIRLY: , 2002 .

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

[19]  Roie Zivan,et al.  Can trust increase the efficiency of cake cutting algorithms? , 2011, AAMAS.

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

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

[22]  Yonatan Aumann,et al.  Throw One's Cake - and Eat It Too , 2011, SAGT.

[23]  ConitzerVincent,et al.  The ACM transactions on economics and computation , 2013 .

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

[25]  T. Hill.  Determining a Fair Border , 1983 .

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

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

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

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

[30]  Walter Stromquist,et al.  Cutting a Pie Is Not a Piece of Cake , 2008, Am. Math. Mon..