Cutting a Cake Fairly for Groups Revisited

IF 0.4 4区 数学 Q4 MATHEMATICS
Erel Segal-Halevi, Warut Suksompong
{"title":"Cutting a Cake Fairly for Groups Revisited","authors":"Erel Segal-Halevi, Warut Suksompong","doi":"10.1080/00029890.2022.2153566","DOIUrl":null,"url":null,"abstract":"Abstract Cake cutting is a classic fair division problem, with the cake serving as a metaphor for a heterogeneous divisible resource. Recently, it was shown that for any number of players with arbitrary preferences over a cake, it is possible to partition the players into groups of any desired size and divide the cake among the groups so that each group receives a single contiguous piece and every player is envy-free. For two groups, we characterize the group sizes for which such an assignment can be computed by a finite algorithm, showing that the task is possible exactly when one of the groups is a singleton. We also establish an analogous existence result for chore division, and show that the result does not hold for a mixed cake.","PeriodicalId":7761,"journal":{"name":"American Mathematical Monthly","volume":"130 1","pages":"203 - 213"},"PeriodicalIF":0.4000,"publicationDate":"2023-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"American Mathematical Monthly","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/00029890.2022.2153566","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 2

Abstract

Abstract Cake cutting is a classic fair division problem, with the cake serving as a metaphor for a heterogeneous divisible resource. Recently, it was shown that for any number of players with arbitrary preferences over a cake, it is possible to partition the players into groups of any desired size and divide the cake among the groups so that each group receives a single contiguous piece and every player is envy-free. For two groups, we characterize the group sizes for which such an assignment can be computed by a finite algorithm, showing that the task is possible exactly when one of the groups is a singleton. We also establish an analogous existence result for chore division, and show that the result does not hold for a mixed cake.
为再次到访的团体公平切蛋糕
蛋糕分割是一个经典的公平分割问题,蛋糕隐喻了一种异构的可分割资源。最近,有研究表明,对于任意数量的玩家对蛋糕有任意偏好,可以将玩家分成任意大小的小组,并将蛋糕分成不同的小组,这样每个小组都能得到一块连续的蛋糕,每个玩家都不会嫉妒。对于两个组,我们描述了可以用有限算法计算这样的分配的组大小,表明了当其中一个组是单例时,任务是可能的。我们还建立了家务分割的一个类似存在性结果,并证明该结果对混合蛋糕不成立。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
American Mathematical Monthly
American Mathematical Monthly Mathematics-General Mathematics
CiteScore
0.80
自引率
20.00%
发文量
127
审稿时长
6-12 weeks
期刊介绍: The Monthly''s readers expect a high standard of exposition; they look for articles that inform, stimulate, challenge, enlighten, and even entertain. Monthly articles are meant to be read, enjoyed, and discussed, rather than just archived. Articles may be expositions of old or new results, historical or biographical essays, speculations or definitive treatments, broad developments, or explorations of a single application. Novelty and generality are far less important than clarity of exposition and broad appeal. Appropriate figures, diagrams, and photographs are encouraged. Notes are short, sharply focused, and possibly informal. They are often gems that provide a new proof of an old theorem, a novel presentation of a familiar theme, or a lively discussion of a single issue. Abstracts for articles or notes should entice the prospective reader into exploring the subject of the paper and should make it clear to the reader why this paper is interesting and important. The abstract should highlight the concepts of the paper rather than summarize the mechanics. The abstract is the first impression of the paper, not a technical summary of the paper. Excessive use of notation is discouraged as it can limit the interest of the broad readership of the MAA, and can limit search-ability of the article.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信