How to cut a cake fairly using a minimal number of cuts

DOI10.1016/S0166-218X(96)00032-7zbMath0876.90100MaRDI QIDQ1356520

William A. Webb

Publication date: 9 June 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

fair divisioncake cuttingminimum number of cuts

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (6)

Fair multi-cake cutting ⋮ Efficient Fair Division with Minimal Sharing ⋮ An algorithm for super envy-free cake division ⋮ Disproportionate division ⋮ On the complexity of cake cutting ⋮ Fair cake-cutting among families

Cites Work

• Unnamed Item
• A note on cake cutting
• A combinatorial algorithm to establish a fair border
• A note on the cake-division problem
• Dividing a cake fairly
• Ramsey partitions of integers and fair divisions
• On envy-free cake division
• Approximating fair division with a limited number of cuts
• Old and new moving-knife schemes
• Constructing a Fair Border
• Determining a Fair Border
• The equivalence- singularity problem for Gaussian signals in Gaussian noise (Corresp.)
• How to Cut A Cake Fairly
• 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
• A Note on the Fair Division Problem
• Sur la division pragmatique

This page was built for publication: How to cut a cake fairly using a minimal number of cuts