Cake-cutting with different entitlements: how many cuts are needed?

DOI10.1016/J.JMAA.2019.123382MaRDI QIDQ2325916zbMATH OpenOpenAlexWikidataFDO

Authors Erel Segal-Halevi

Publication date 4 October 2019

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.05470

zbMATH Keywords

asymmetric agentsconnected componentsfair cake-cuttingland divisionunequal shares

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Abstract: A cake has to be divided fairly among $n$ agents. When all agents have equal entitlements, it is known that such a division can be implemented with $n-1$ cuts. When agents may have different entitlements, the paper shows that at least $2n-2$ cuts may be necessary, and $O(nlog(n))$ cuts are always sufficient.

Recommendations

• How to cut a cake fairly using a minimal number of cuts
• scientific article; zbMATH DE number 21741
• scientific article; zbMATH DE number 1962847
• Approximating fair division with a limited number of cuts
• Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond

Cites work

• Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
• Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division
• Extensions of cut-and-choose fair division
• Game-theoretic algorithms for fair and strongly fair cake division with entitlements
• 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 5240213 (Why is no real title available?)
• Ramsey partitions of integers and fair divisions
• Sets on which several measures agree

Cited in

(12)

• Picking sequences and monotonicity in weighted fair division
• Mind the gap: cake cutting with separation
• Fair cake-cutting among families
• How to divide a cake when people have different metabolism?
• Fair multi-cake cutting
• Efficient Fair Division with Minimal Sharing
• Disproportionate division
• Keep your distance: land division with separation
• Weighted fair division of indivisible items: a review
• Asymptotic analysis of weighted fair division
• Fairer than fair: sharp bounds for connected super-proportional cake cutting
• Fair division is hard even for amicable agents

This page was built for publication: Cake-cutting with different entitlements: how many cuts are needed?

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