A moving-knife solution to the four-person envy-free cake-division problem

Beams Steven J, Alan D. Taylor, William S. Zwicker

    Research output: Contribution to journalArticlepeer-review

    Abstract

    We present a moving-knife procedure, requiring only 11 cuts, that produces an envy-free allocation of a cake among four players and discuss possible extensions to five players.

    Original languageEnglish (US)
    Pages (from-to)547-554
    Number of pages8
    JournalProceedings of the American Mathematical Society
    Volume125
    Issue number2
    StatePublished - 1997

    ASJC Scopus subject areas

    • Mathematics(all)
    • Applied Mathematics

    Fingerprint

    Dive into the research topics of 'A moving-knife solution to the four-person envy-free cake-division problem'. Together they form a unique fingerprint.

    Cite this