Two-person cake cutting: the optimal number of cuts

DOI10.1007/S00283-013-9442-0zbMath1303.91098OpenAlexW3123908604MaRDI QIDQ483349

Steven J. Brams, Julius B. Barbanel

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

Mathematics Subject Classification ID

2-person games (91A05) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (3)

Fair multi-cake cutting ⋮ Efficient Fair Division with Minimal Sharing ⋮ Fair cake-cutting among families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of group decision and negotiation
• 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
• 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
• <em>N</em>-Person Cake-Cutting: There May Be No Perfect Division

This page was built for publication: Two-person cake cutting: the optimal number of cuts