Existence of a simple and equitable fair division: a short proof
From MaRDI portal
Abstract: In this note we study how to share a good between n players in a simple and equitable way. We give a short proof for the existence of such fair divisions.
Recommendations
Cites work
- scientific article; zbMATH DE number 1234106 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- scientific article; zbMATH DE number 2153479 (Why is no real title available?)
- scientific article; zbMATH DE number 1409181 (Why is no real title available?)
- A Simple Proof of the Hobby-Rice Theorem
- An Envy-Free Cake Division Protocol
- Cake cutting algorithms
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Dividing a cake fairly
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
- On the existence of equitable cake divisions
- Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
- Splitting necklaces
- \(N\)-person cake-cutting: there may be no perfect division
Cited in
(7)- Cake cutting: explicit examples for impossibility results
- Cutting a cake for infinitely many guests
- How to cut a cake with a Gram matrix
- Resource-monotonicity and population-monotonicity in connected cake-cutting
- On the computability of equitable divisions
- Simple fair division of a square
- Mind the gap: cake cutting with separation
This page was built for publication: Existence of a simple and equitable fair division: a short proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2406943)