Envy-free cake divisions cannot be found by finite protocols
From MaRDI portal
Publication:1010716
zbMath1158.91403MaRDI QIDQ1010716
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129749
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 (27)
Cutting a Cake Fairly for Groups Revisited ⋮ The problem of fair division for a hybrid resource ⋮ Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting ⋮ Envy-free division of multi-layered cakes ⋮ Three Persons, Two Cuts: A New Cake-Cutting Algorithm ⋮ Fair multi-cake cutting ⋮ Fairness and efficiency in cake-cutting with single-peaked preferences ⋮ On the computability of equitable divisions ⋮ Approximate and strategyproof maximin share allocation of chores with ordinal preferences ⋮ On existence of truthful fair cake cutting mechanisms ⋮ A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ How to Cut a Cake Fairly: A Generalization to Groups ⋮ Fairly allocating contiguous blocks of indivisible items ⋮ Expand the shares together: envy-free mechanisms with a small number of cuts ⋮ Fair Division ⋮ Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts ⋮ How to divide the indivisible ⋮ The efficiency of fair division ⋮ Democratic fair allocation of indivisible goods ⋮ Envy-Free Division of Land ⋮ Fair and efficient cake division with connected pieces ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ How to share a cake with a secret agent ⋮ Cake cutting: explicit examples for impossibility results ⋮ Mind the gap: cake cutting with separation ⋮ Fair Cake Division Under Monotone Likelihood Ratios
This page was built for publication: Envy-free cake divisions cannot be found by finite protocols
