A note on the cake-division problem

DOI10.1016/0097-3165(86)90101-9zbMath0592.90023OpenAlexW1987698511MaRDI QIDQ1075937

Douglas R. Woodall

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90101-9

zbMATH Keywords

Borel setsfair divisioncake divisionnon-atomic probability measure

Mathematics Subject Classification ID

Mathematical economics (91B99)

Related Items (7)

Cutting a cake for infinitely many guests ⋮ On envy-free cake division ⋮ How to cut a cake fairly using a minimal number of cuts ⋮ Approximating fair division with a limited number of cuts ⋮ A combinatorial algorithm to establish a fair border ⋮ An algorithm for super envy-free cake division ⋮ On the complexity of cake cutting

Cites Work

• Unnamed Item
• Unnamed Item
• Sets on which several measures agree
• Dividing a cake fairly
• How to Cut A Cake Fairly
• A Note on the Fair Division Problem

This page was built for publication: A note on the cake-division problem