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

מדעי המחשב

פרסום מחקרי: פרסום בכתב עת › מאמר › ביקורת עמיתים

22 ציטוטים ‏(Scopus)

תקציר

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.

שפה מקורית	אנגלית
מספר המאמר	123382
כתב עת	Journal of Mathematical Analysis and Applications
כרך	480
מספר גיליון	1
מזהי עצם דיגיטלי (DOIs)	https://doi.org/10.1016/j.jmaa.2019.123382
סטטוס פרסום	פורסם - 1 דצמ׳ 2019

גישה למסמך

10.1016/j.jmaa.2019.123382

קבצים וקישורים אחרים

Link to publication in Scopus

פורמט ציטוט ביבליוגרפי

@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 - https://www.scopus.com/pages/publications/85070766916

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?

תקציר

גישה למסמך

קבצים וקישורים אחרים

טביעת אצבע

פורמט ציטוט ביבליוגרפי