N-person cake-cutting: there may be no perfect division
DOI10.4169/AMER.MATH.MONTHLY.120.01.035zbMATH Open1266.91011OpenAlexW1832254459WikidataQ58281588 ScholiaQ58281588MaRDI QIDQ4923957FDOQ4923957
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
Recommendations
Cooperative games (91A12) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Stochastic games, stochastic differential games (91A15)
Cited In (12)
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Cake cutting: explicit examples for impossibility results
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Fair Division
- Cutting a Cake Fairly for Groups Revisited
- Disproportionate division
- Children crying at birthday parties. Why?
- Existence of a simple and equitable fair division: a short proof
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Fair cake-cutting for imitative agents
- Two-person cake cutting: the optimal number of cuts
- Throw one's cake -- and eat it too
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)