Recommendations
Cites work
Cited in
(32)- Fair choice sequences
- When \textit{I cut, you choose} method implies intransitivity
- The adjusted Knaster procedure under unequal entitlements.
- Approximating fair division with a limited number of cuts
- Old and new moving-knife schemes
- An algorithm for super envy-free cake division
- Cutting a cake for infinitely many guests
- The fair division of hereditary set systems
- Cake-cutting with different entitlements: how many cuts are needed?
- How to share a cake with a secret agent
- Existence of a simple and equitable fair division: a short proof
- Impartial division of a dollar
- How to cut a pizza fairly: fair division with decreasing marginal evaluations
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Fair cake-cutting for imitative agents
- Stochastic design in cake division problem
- Throw one's cake -- and eat it too
- Online cake cutting
- Optimal fair division for measures with piecewise linear density functions
- scientific article; zbMATH DE number 3849005 (Why is no real title available?)
- scientific article; zbMATH DE number 21741 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- Two-person cake cutting: the optimal number of cuts
- Preference Relations and Measures in the Context of Fair Division
- Game-theoretic algorithms for fair and strongly fair cake division with entitlements
- Three persons, two cuts: a new cake-cutting algorithm
- Disproportionate division
- How to cut a cake fairly: a generalization to groups
- Optimal fair division for measures with piecewise linear density functions
- Stochastic cake division protocol
- Cutting a Cake Fairly for Groups Revisited
- Elementary solution to the fair division problem
This page was built for publication: Extensions of cut-and-choose fair division
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677613)
