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

DOI10.4169/AMER.MATH.MONTHLY.120.01.035MaRDI QIDQ4923957zbMATH OpenOpenAlexWikidataFDO

Authors Steven J. Brams, Michael A. Jones, Christian Klamler

Publication date 28 May 2013

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/amer.math.monthly.120.01.035

zbMATH Keywords

efficiencyenvy-freenessequitabilityfairness

Mathematics Subject Classification ID

Cooperative games (91A12) Stochastic games, stochastic differential games (91A15) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Two-player envy-free multi-cake division
• Cutting a pie is not a piece of cake
• Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
• Envy-free cake divisions cannot be found by finite protocols
• Envy-free division of discrete cakes

Cited in

(13)

• Fair allocation of indivisible goods with minimum inequality or minimum envy
• Cake cutting: explicit examples for impossibility results
• Existence of a simple and equitable fair division: a short proof
• Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
• Fair cake-cutting for imitative agents
• Throw one's cake -- and eat it too
• Two-person cake cutting: the optimal number of cuts
• Disproportionate division
• Fair Division
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Cutting a Cake Fairly for Groups Revisited
• Between proportionnality and envy-freeness: k-proportionality
• Children crying at birthday parties. Why?

This page was built for publication: \(N\)-person cake-cutting: there may be no perfect division

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923957)