A note on the cake-division problem

DOI10.1016/0097-3165(86)90101-9MaRDI QIDQ1075937zbMATH OpenOpenAlexFDO

Authors 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

fair divisionBorel setscake divisionnon-atomic probability measure

Mathematics Subject Classification ID

Mathematical economics (91B99)

Recommendations

• On the possibilities for partitioning a cake
• On the geometry of cake division
• scientific article; zbMATH DE number 1409181
• Two applications of a theorem of Dvoretsky, Wald, and Wolfovits to cake division
• On envy-free cake division

Cites work

• scientific article; zbMATH DE number 3136641 (Why is no real title available?)
• scientific article; zbMATH DE number 3501238 (Why is no real title available?)
• A Note on the Fair Division Problem
• Dividing a cake fairly
• How to Cut A Cake Fairly
• Sets on which several measures agree

Cited in

(16)

• scientific article; zbMATH DE number 5598643 (Why is no real title available?)
• scientific article; zbMATH DE number 3914019 (Why is no real title available?)
• On the complexity of cake cutting
• Cutting a cake for infinitely many guests
• On the existence of equitable cake divisions
• On the geometry of cake division
• An algorithm for super envy-free cake division
• On a method of obtaining an approximate solution of an exact fair division problem
• A combinatorial algorithm to establish a fair border
• On the possibilities for partitioning a cake
• On envy-free cake division
• On partitioning a cake
• How to cut a cake fairly using a minimal number of cuts
• Stochastic design in cake division problem
• Approximating fair division with a limited number of cuts
• On cake dividing

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

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