Two-person cake cutting: the optimal number of cuts
From MaRDI portal
Publication:483349
DOI10.1007/S00283-013-9442-0zbMATH Open1303.91098OpenAlexW3123908604MaRDI QIDQ483349FDOQ483349
Authors: Julius B. Barbanel, Steven J. Brams
Publication date: 17 December 2014
Published in: The Mathematical Intelligencer (Search for Journal in Brave)
Full work available at URL: https://mpra.ub.uni-muenchen.de/34263/1/MPRA_paper_34263.pdf
Recommendations
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) 2-person games (91A05)
Cites Work
- Handbook of group decision and negotiation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
- Title not available (Why is that?)
- Fair division of a measurable space
- On the structure of Pareto optimal cake partitions
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Proportional pie-cutting
- Two-Person Pie-Cutting: The Fairest Cuts
- Cutting a pie is not a piece of cake
- Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods
- Title not available (Why is that?)
- \(N\)-person cake-cutting: there may be no perfect division
- Better ways to cut a cake
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)