论文标题
如何公平切蛋糕：对小组的概括
How to Cut a Cake Fairly: A Generalization to Groups
论文作者
论文摘要
蛋糕切割的基本结果指出，对于蛋糕上任意偏好的任何数量的玩家，都存在一个蛋糕的划分，因此每个玩家都会收到一个连续的比赛，而且没有球员羡慕不已。我们通过表明可以将玩家分为任何所需尺寸的组并将蛋糕分开的组来概括这个结果，以便每个组都会收到一个连续的一块，并且没有玩家发现另一组比玩家自己的小组更好。
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.
