Cutting a Cake for Five People

DOI10.1007/978-3-642-02158-9_25zbMath1246.91006OpenAlexW1866822747MaRDI QIDQ3638457

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

Mathematics Subject Classification ID

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

Related Items (2)

The efficiency of fair division ⋮ Envy-Free Division of Land

Cites Work

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

This page was built for publication: Cutting a Cake for Five People