How to Cut a Cake Fairly A Generalization to Groups

Document pages: 5 pages

Abstract: A fundamental result in cake cutting states that for any number of playerswith arbitrary preferences over a cake, there exists a division of the cakesuch that every player receives a single contiguous piece and no player is leftenvious. We generalize this result by showing that it is possible to partitionthe players into groups of any desired sizes and divide the cake among thegroups, so that each group receives a single contiguous piece and no playerfinds the piece of another group better than that of the player s own group.