Cake-cutting with different entitlements: How many cuts are needed?

Erel Segal-Halevi

doi:10.1016/j.jmaa.2019.123382

Cake-cutting with different entitlements: How many cuts are needed?

Erel Segal-Halevi

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

Abstract

A cake has to be divided fairly among n agents. When all agents have equal entitlements, it is known that such a division can be implemented with n−1 cuts. When agents may have different entitlements, the paper shows that at least 2n−2 cuts may be necessary, and O(nlog⁡n) cuts are always sufficient.

Original language	English
Article number	123382
Journal	Journal of Mathematical Analysis and Applications
Volume	480
Issue number	1
DOIs	https://doi.org/10.1016/j.jmaa.2019.123382
State	Published - 1 Dec 2019

Keywords

Asymmetric agents
Connected components
Fair cake-cutting
Land division
Unequal shares

Access to Document

10.1016/j.jmaa.2019.123382

Cite this

@article{763af60cdec547bb97b3a8e7817ee740,

title = "Cake-cutting with different entitlements: How many cuts are needed?",

abstract = "A cake has to be divided fairly among n agents. When all agents have equal entitlements, it is known that such a division can be implemented with n−1 cuts. When agents may have different entitlements, the paper shows that at least 2n−2 cuts may be necessary, and O(nlog⁡n) cuts are always sufficient.",

keywords = "Asymmetric agents, Connected components, Fair cake-cutting, Land division, Unequal shares",

author = "Erel Segal-Halevi",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier Inc.",

year = "2019",

month = dec,

day = "1",

doi = "10.1016/j.jmaa.2019.123382",

language = "אנגלית",

volume = "480",

journal = "Journal of Mathematical Analysis and Applications",

issn = "0022-247X",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Cake-cutting with different entitlements

T2 - How many cuts are needed?

AU - Segal-Halevi, Erel

PY - 2019/12/1

Y1 - 2019/12/1

N2 - A cake has to be divided fairly among n agents. When all agents have equal entitlements, it is known that such a division can be implemented with n−1 cuts. When agents may have different entitlements, the paper shows that at least 2n−2 cuts may be necessary, and O(nlog⁡n) cuts are always sufficient.

AB - A cake has to be divided fairly among n agents. When all agents have equal entitlements, it is known that such a division can be implemented with n−1 cuts. When agents may have different entitlements, the paper shows that at least 2n−2 cuts may be necessary, and O(nlog⁡n) cuts are always sufficient.

KW - Asymmetric agents

KW - Connected components

KW - Fair cake-cutting

KW - Land division

KW - Unequal shares

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

U2 - 10.1016/j.jmaa.2019.123382

DO - 10.1016/j.jmaa.2019.123382

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85070766916

SN - 0022-247X

VL - 480

JO - Journal of Mathematical Analysis and Applications

JF - Journal of Mathematical Analysis and Applications

IS - 1

M1 - 123382

ER -

Cake-cutting with different entitlements: How many cuts are needed?

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this