当前位置: X-MOL 学术arXiv.cs.GT › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
How to Cut a Cake Fairly: A Generalization to Groups
arXiv - CS - Computer Science and Game Theory Pub Date : 2020-01-10 , DOI: arxiv-2001.03327
Erel Segal-Halevi, Warut Suksompong

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.

中文翻译:

如何公平地切蛋糕:对群体的概括

切蛋糕的一个基本结果表明,对于对蛋糕有任意偏好的任意数量的玩家,存在蛋糕的分割,使得每个玩家都收到一个连续的一块,并且没有玩家会嫉妒。我们通过展示可以将玩家分成任何所需大小的组并将蛋糕分给各组来概括这个结果,这样每个组都会收到一个连续的棋子,并且没有玩家找到比另一组更好的棋子玩家自己的组。
更新日期:2020-04-06
down
wechat
bug