N-person cake-cutting: There may be no perfect division

Steven Brams, Michael A. Jones, Christian Klamler

    Research output: Contribution to journalArticle

    Abstract

    A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake that is impossible to divide among three players, so that these three properties are satisfied, however many (finite) cuts are made. It turns out that two of the three properties can be satisfied by a 3-cut and a 4-cut division, which raises the question of whether the 3-cut division, which is not efficient, or the 4-cut division, which is not envy-free, is more desirable (a 2-cut division can at best satisfy either envy-freeness or equitability, but not both). We prove that no perfect division exists for more than 4 cuts and for an extension of this example to more than three players.

    Original languageEnglish (US)
    Pages (from-to)35-47
    Number of pages13
    JournalAmerican Mathematical Monthly
    Volume120
    Issue number1
    DOIs
    StatePublished - Jan 2013

    Fingerprint

    Division
    Person
    Divisible
    Divides

    ASJC Scopus subject areas

    • Mathematics(all)

    Cite this

    N-person cake-cutting : There may be no perfect division. / Brams, Steven; Jones, Michael A.; Klamler, Christian.

    In: American Mathematical Monthly, Vol. 120, No. 1, 01.2013, p. 35-47.

    Research output: Contribution to journalArticle

    Brams, Steven ; Jones, Michael A. ; Klamler, Christian. / N-person cake-cutting : There may be no perfect division. In: American Mathematical Monthly. 2013 ; Vol. 120, No. 1. pp. 35-47.
    @article{b3c51b24d8634e588b26c606b5e0cbd4,
    title = "N-person cake-cutting: There may be no perfect division",
    abstract = "A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake that is impossible to divide among three players, so that these three properties are satisfied, however many (finite) cuts are made. It turns out that two of the three properties can be satisfied by a 3-cut and a 4-cut division, which raises the question of whether the 3-cut division, which is not efficient, or the 4-cut division, which is not envy-free, is more desirable (a 2-cut division can at best satisfy either envy-freeness or equitability, but not both). We prove that no perfect division exists for more than 4 cuts and for an extension of this example to more than three players.",
    author = "Steven Brams and Jones, {Michael A.} and Christian Klamler",
    year = "2013",
    month = "1",
    doi = "10.4169/amer.math.monthly.120.01.035",
    language = "English (US)",
    volume = "120",
    pages = "35--47",
    journal = "American Mathematical Monthly",
    issn = "0002-9890",
    publisher = "Mathematical Association of America",
    number = "1",

    }

    TY - JOUR

    T1 - N-person cake-cutting

    T2 - There may be no perfect division

    AU - Brams, Steven

    AU - Jones, Michael A.

    AU - Klamler, Christian

    PY - 2013/1

    Y1 - 2013/1

    N2 - A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake that is impossible to divide among three players, so that these three properties are satisfied, however many (finite) cuts are made. It turns out that two of the three properties can be satisfied by a 3-cut and a 4-cut division, which raises the question of whether the 3-cut division, which is not efficient, or the 4-cut division, which is not envy-free, is more desirable (a 2-cut division can at best satisfy either envy-freeness or equitability, but not both). We prove that no perfect division exists for more than 4 cuts and for an extension of this example to more than three players.

    AB - A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake that is impossible to divide among three players, so that these three properties are satisfied, however many (finite) cuts are made. It turns out that two of the three properties can be satisfied by a 3-cut and a 4-cut division, which raises the question of whether the 3-cut division, which is not efficient, or the 4-cut division, which is not envy-free, is more desirable (a 2-cut division can at best satisfy either envy-freeness or equitability, but not both). We prove that no perfect division exists for more than 4 cuts and for an extension of this example to more than three players.

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

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

    U2 - 10.4169/amer.math.monthly.120.01.035

    DO - 10.4169/amer.math.monthly.120.01.035

    M3 - Article

    AN - SCOPUS:84875167304

    VL - 120

    SP - 35

    EP - 47

    JO - American Mathematical Monthly

    JF - American Mathematical Monthly

    SN - 0002-9890

    IS - 1

    ER -