Cutting a Cake for Five People

DOI10.1007/978-3-642-02158-9_25zbMATH Open1246.91006OpenAlexW1866822747MaRDI QIDQ3638457FDOQ3638457

Ying Wang, Amin Saberi

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

• 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

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)

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 (4)

• Fair cake-cutting among families
• 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)