How to Cut a Cake Fairly: A Generalization to Groups

Abstract A fundamental result in cake cutting states that for any number of players with arbitrary preferences over a cake, there exists a division of the cake such that every player receives a single contiguous piece and no player is left envious. We generalize this result by showing that it is possible to partition the players into groups of any desired sizes and divide the cake among the groups so that each group receives a single contiguous piece, and no player finds the piece of another group better than that of the player’s own group.

[1]  Paul W. Goldberg,et al.  Contiguous Cake Cutting: Hardness Results and Approximation Algorithms , 2019, AAAI.

[2]  Frédéric Meunier,et al.  Multilabeled versions of Sperner's and Fan's lemmas and applications , 2019, SIAM J. Appl. Algebra Geom..

[3]  Warut Suksompong,et al.  Approximate maximin shares for groups of agents , 2017, Math. Soc. Sci..

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

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

[6]  Erel Segal-Halevi,et al.  Fair and Efficient Division among Families , 2018 .

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

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

[9]  Mohammad Ghodsi,et al.  Rent Division Among Groups , 2018, COCOA.

[10]  Warut Suksompong,et al.  Democratic Fair Allocation of Indivisible Goods , 2017, IJCAI.

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

[12]  Erel Segal-Halevi,et al.  Democratic fair allocation of indivisible goods , 2019, Artif. Intell..

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

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

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

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

[17]  Warut Suksompong,et al.  Almost Envy-Freeness in Group Resource Allocation , 2019, IJCAI.

[18]  Gerhard J. Woeginger,et al.  Group Activity Selection Problem , 2012, WINE.

[19]  Eran Shmaya,et al.  Rental harmony with roommates , 2014, J. Econ. Theory.