Approximating fair division with a limited number of cuts

DOI10.1016/0097-3165(95)90073-XzbMath0837.90135MaRDI QIDQ1903017

Jack M. Robertson, William A. Webb

Publication date: 5 December 1995

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

fair divisioncake divisionlimited number of cuts

Mathematics Subject Classification ID

Cooperative games (91A12) Individual preferences (91B08)

Related Items (5)

How to cut a cake fairly using a minimal number of cuts ⋮ An algorithm for super envy-free cake division ⋮ On the complexity of cake cutting ⋮ Fair cake-cutting among families ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents

Cites Work

• A note on cake cutting
• A note on the cake-division problem
• Splitting necklaces
• Dividing a cake fairly
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating fair division with a limited number of cuts