Two-person cake cutting: the optimal number of cuts
From MaRDI portal
(Redirected from Publication:483349)
Recommendations
Cites work
- scientific article; zbMATH DE number 1234106 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- scientific article; zbMATH DE number 2153479 (Why is no real title available?)
- scientific article; zbMATH DE number 5240213 (Why is no real title available?)
- Better ways to cut a cake
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Cutting a pie is not a piece of cake
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
- Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods
- Fair division of a measurable space
- Handbook of group decision and negotiation
- On the structure of Pareto optimal cake partitions
- Proportional pie-cutting
- Two-Person Pie-Cutting: The Fairest Cuts
- \(N\)-person cake-cutting: there may be no perfect division
Cited in
(6)
This page was built for publication: Two-person cake cutting: the optimal number of cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q483349)