Cutting a Cake for Five People

DOI10.1007/978-3-642-02158-9_25MaRDI QIDQ3638457zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Noncooperative games (91A10) (n)-person games, (n>2) (91A06)

Recommendations

• An Envy-Free Cake Division Protocol
• Old and new moving-knife schemes
• Envy-free division of discrete cakes
• Envy-free division of discrete cakes
• Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond

Cites work

• A lower bound for cake cutting
• A moving-knife solution to the four-person envy-free cake-division problem
• A note on cake cutting
• Algorithmic solutions for envy-free cake cutting
• An Envy-Free Cake Division Protocol
• Cake cutting really is not a piece of cake
• Confidently Cutting a Cake into Approximately Fair Pieces
• How to Cut a Cake Fairly
• Rental Harmony: Sperner's Lemma in Fair Division
• Sur la division pragmatique

Cited in

(8)

• Algorithmic solutions for envy-free cake cutting
• Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
• An improved envy-free cake cutting protocol for four agents
• The efficiency of fair division
• Envy-Free Division of Land
• Fair cake-cutting among families
• Envy-free division of discrete cakes
• Waste makes haste: bounded time algorithms for envy-free cake cutting with free disposal

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)