Approximating fair division with a limited number of cuts

DOI10.1016/0097-3165(95)90073-XzbMATH Open0837.90135MaRDI QIDQ1903017FDOQ1903017

Authors: Jack M. Robertson, William A. Webb 

Publication date: 5 December 1995

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

Recommendations

• scientific article; zbMATH DE number 21741
• scientific article; zbMATH DE number 1234106
• scientific article; zbMATH DE number 1947449
• An approximation scheme for cake division with a linear number of cuts
• Extensions of cut-and-choose fair division

zbMATH Keywords

fair divisioncake divisionlimited number of cuts

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• How to Cut A Cake Fairly
• Splitting necklaces
• How to Cut a Cake Fairly
• Dividing a cake fairly
• Title not available (Why is that?)
• A note on cake cutting
• A note on the cake-division problem
• Title not available (Why is that?)

Cited In (15)

• A muffin-theorem generator
• Fair cake-cutting among families
• Title not available (Why is that?)
• On the complexity of cake cutting
• Ramsey partitions of integers and fair divisions
• Cutting a cake for infinitely many guests
• Efficient Fair Division with Minimal Sharing
• An approximation scheme for cake division with a linear number of cuts
• Cake-cutting with different entitlements: how many cuts are needed?
• An algorithm for super envy-free cake division
• On a method of obtaining an approximate solution of an exact fair division problem
• Cutting cakes carefully
• Title not available (Why is that?)
• How to cut a cake fairly using a minimal number of cuts
• Two's company, three's a crowd: consensus-halving for a constant number of agents

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903017)