{"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.
期刊介绍:
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.