Cutting a Cake for Five People
From MaRDI portal
Publication:3638457
DOI10.1007/978-3-642-02158-9_25zbMATH Open1246.91006OpenAlexW1866822747MaRDI QIDQ3638457FDOQ3638457
Publication date: 2 July 2009
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_25
Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10) (n)-person games, (n>2) (91A06)
Cites Work
- Rental Harmony: Sperner's Lemma in Fair Division
- How to Cut a Cake Fairly
- Sur la division pragmatique
- A moving-knife solution to the four-person envy-free cake-division problem
- An Envy-Free Cake Division Protocol
- Cake cutting really is not a piece of cake
- A note on cake cutting
- Algorithmic Solutions for Envy-Free Cake Cutting
- Confidently Cutting a Cake into Approximately Fair Pieces
- Algorithms - ESA 2003
Cited In (3)
This page was built for publication: Cutting a Cake for Five People
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638457)