A note on the cake-division problem
From MaRDI portal
Let C (the cake) be a compact convex set, and let each of n people define a non-atomic probability measure on the Borel sets of C. It is well known that C can be divided among the n people so that each receives at least 1/n of it (in his own measure), and even, if the n measures are not all identical, so that each receives more than 1/n of it. No constructive proof was known of this latter result. This note provides one.
Recommendations
Cites work
Cited in
(18)- On envy-free cake division
- How to cut a cake fairly using a minimal number of cuts
- Two applications of a theorem of Dvoretsky, Wald, and Wolfovits to cake division
- Approximating fair division with a limited number of cuts
- An algorithm for super envy-free cake division
- Cutting a cake for infinitely many guests
- On the complexity of cake cutting
- On the existence of equitable cake divisions
- Stochastic design in cake division problem
- 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 possibilities for partitioning a cake
- On a method of obtaining an approximate solution of an exact fair division problem
- On partitioning a cake
- On cake dividing
- On the geometry of cake division
- Fairer than fair: sharp bounds for connected super-proportional cake cutting
- A combinatorial algorithm to establish a fair border
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)
