Envy-free cake divisions cannot be found by finite protocols
zbMATH Open1158.91403MaRDI QIDQ1010716FDOQ1010716
Authors: Walter Stromquist 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Extremal set theory (05D05)
Cited In (38)
- The problem of fair division for a hybrid resource
- Envy-free division of discrete cakes
- Fairness and efficiency in cake-cutting with single-peaked preferences
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Fair multi-cake cutting
- Cake cutting: explicit examples for impossibility results
- How to share a cake with a secret agent
- On existence of truthful fair cake cutting mechanisms
- Fair Division
- Expand the shares together: envy-free mechanisms with a small number of cuts
- Elementary solution to the fair division problem
- Cutting a Cake Fairly for Groups Revisited
- Contiguous cake cutting: hardness results and approximation algorithms
- Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts
- Three persons, two cuts: a new cake-cutting algorithm
- A discrete and bounded locally envy-free cake cutting protocol on trees
- Approximate envy-freeness in graphical cake cutting
- A three-player envy-free discrete division protocol for mixed manna
- Envy-free division of multi-layered cakes
- How to cut a cake fairly: a generalization to groups
- On the computability of equitable divisions
- Envy-Free Division of Land
- On Envy-Free Cake Division
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Democratic fair allocation of indivisible goods
- The efficiency of fair division
- Fair Cake Division Under Monotone Likelihood Ratios
- Fair and efficient cake division with connected pieces
- Logarithmic algorithms for fair division problems
- Bribe-proof rules in the division problem
- Meta-Envy-Free Cake-Cutting Protocols
- Dividing a graphical cake
- A parametric worst-case approach to fairness in cooperative games with transferable utility
- Envy-free cake division without assuming the players prefer nonempty pieces
- How to divide the indivisible
- Approximate and strategyproof maximin share allocation of chores with ordinal preferences
- \(N\)-person cake-cutting: there may be no perfect division
- Mind the gap: cake cutting with separation
This page was built for publication: Envy-free cake divisions cannot be found by finite protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010716)
