How to Cut a Cake Fairly: A Generalization to Groups

Erel Segal-Halevi; Warut Suksompong

doi:10.1080/00029890.2021.1835338

How to Cut a Cake Fairly: A Generalization to Groups

Erel Segal-Halevi, Warut Suksompong

Research output: Contribution to journal › Comment/debate

11 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	79-83
Number of pages	5
Journal	American Mathematical Monthly
Volume	128
Issue number	1
DOIs	https://doi.org/10.1080/00029890.2021.1835338
State	Published - 2020
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2021, THE MATHEMATICAL ASSOCIATION OF AMERICA.

Funding

This work was partially supported by the Israel Science Foundation (grant no. 712/20), by the European Research Council (ERC) under grant number 639945 (ACCORD), and by an NUS Start-up Grant. We would like to thank Steven Brams, Walter Stromquist, Rodrigo Velez, as well as the editor and anonymous reviewers for helpful feedback. 1

Funders	Funder number
European Commission	639945
National University of Singapore
Israel Science Foundation	712/20

Keywords

MSC: Primary 91B10
Secondary 91B14

Access to Document

10.1080/00029890.2021.1835338

Cite this

@article{e8474f8425804fcd9278e87eb59cc8c7,

title = "How to Cut a Cake Fairly: A Generalization to Groups",

abstract = "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{\textquoteright}s own group.",

keywords = "MSC: Primary 91B10, Secondary 91B14",

author = "Erel Segal-Halevi and Warut Suksompong",

note = "Publisher Copyright: {\textcopyright} 2021, THE MATHEMATICAL ASSOCIATION OF AMERICA.",

year = "2020",

doi = "10.1080/00029890.2021.1835338",

language = "אנגלית",

volume = "128",

pages = "79--83",

journal = "American Mathematical Monthly",

issn = "0002-9890",

publisher = "Taylor and Francis Ltd.",

number = "1",

}

TY - JOUR

T1 - How to Cut a Cake Fairly

T2 - A Generalization to Groups

AU - Segal-Halevi, Erel

AU - Suksompong, Warut

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

KW - MSC: Primary 91B10

KW - Secondary 91B14

UR - http://www.scopus.com/inward/record.url?scp=85095338906&partnerID=8YFLogxK

U2 - 10.1080/00029890.2021.1835338

DO - 10.1080/00029890.2021.1835338

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.comment???

AN - SCOPUS:85095338906

SN - 0002-9890

VL - 128

SP - 79

EP - 83

JO - American Mathematical Monthly

JF - American Mathematical Monthly

IS - 1

ER -

How to Cut a Cake Fairly: A Generalization to Groups

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this