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
05D05: Extremal set theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Related Items
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms, How to Cut a Cake Fairly: A Generalization to Groups, Fair Division, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Fairly allocating contiguous blocks of indivisible items, How to divide the indivisible, The efficiency of fair division, Fair and efficient cake division with connected pieces, Expand the shares together: envy-free mechanisms with a small number of cuts, On the computability of equitable divisions, Fairness and efficiency in cake-cutting with single-peaked preferences, Democratic fair allocation of indivisible goods, How to share a cake with a secret agent, Cake cutting: explicit examples for impossibility results, 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, Fair multi-cake cutting, Envy-Free Division of Land
