Cutting a Cake for Five People
From MaRDI portal
Publication:3638457
DOI10.1007/978-3-642-02158-9_25zbMATH Open1246.91006OpenAlexW1866822747MaRDI QIDQ3638457FDOQ3638457
Authors: Amin Saberi, Ying Wang 
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
Recommendations
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
- A lower bound for cake cutting
Cited In (8)
- Fair cake-cutting among families
- Envy-free division of discrete cakes
- An improved envy-free cake cutting protocol for four agents
- Waste makes haste: bounded time algorithms for envy-free cake cutting with free disposal
- Algorithmic solutions for envy-free cake cutting
- Envy-Free Division of Land
- The efficiency of fair division
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
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)
