On the computability of equitable divisions

DOI10.1016/j.disopt.2012.08.001zbMath1254.91285OpenAlexW2021459465MaRDI QIDQ1926490

Eva Pillárová, Katarína Cechlárova

Publication date: 28 December 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.08.001

zbMATH Keywords

algorithmapproximationcake cuttingequitable division

Mathematics Subject Classification ID

Extremal set theory (05D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (11)

Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ On a method of obtaining exact fair divisions ⋮ Fairly allocating contiguous blocks of indivisible items ⋮ Resource-monotonicity and population-monotonicity in connected cake-cutting ⋮ Fair division of mixed divisible and indivisible goods ⋮ Unnamed Item ⋮ Fair cake-cutting among families ⋮ Dividing splittable goods evenly and with limited fragmentation ⋮ Cake cutting: explicit examples for impossibility results ⋮ Mind the gap: cake cutting with separation ⋮ Fair Cake Division Under Monotone Likelihood Ratios

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on cake cutting
• Envy-free cake divisions cannot be found by finite protocols
• Splitting necklaces
• Consensus-halving via theorems of Borsuk-Ulam and Tucker
• Old and new moving-knife schemes
• On the complexity of cake cutting
• Throw One’s Cake — and Eat It Too
• The Structure of the Real Line
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly

This page was built for publication: On the computability of equitable divisions