Existence of a simple and equitable fair division: a short proof

DOI10.1016/j.mathsocsci.2017.03.006zbMath1397.91300arXiv1703.09804OpenAlexW2603520418MaRDI QIDQ2406943

Guillaume Chèze

Publication date: 4 October 2017

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.09804

zbMATH Keywords

fair divisionallocation\(n\) players

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (6)

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 ⋮ Simple fair division of a square ⋮ Cake cutting: explicit examples for impossibility results ⋮ Mind the gap: cake cutting with separation

Cites Work

• Splitting necklaces
• Dividing a cake fairly
• Consensus-halving via theorems of Borsuk-Ulam and Tucker
• On the existence of equitable cake divisions
• Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly
• A Simple Proof of the Hobby-Rice Theorem
• An Envy-Free Cake Division Protocol
• <em>N</em>-Person Cake-Cutting: There May Be No Perfect Division
• Cake Cutting Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Existence of a simple and equitable fair division: a short proof