Envy-free cake division without assuming the players prefer nonempty pieces

DOI10.1007/S11856-019-1939-6zbMath1432.91067arXiv1804.00449OpenAlexW2980311921WikidataQ127155619 ScholiaQ127155619MaRDI QIDQ2279957

Frédéric Meunier, Shira Zerbib

Publication date: 17 December 2019

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

envy-free cake divisionnonempty pieces preference

Mathematics Subject Classification ID

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

Related Items (12)

Cutting a Cake Fairly for Groups Revisited ⋮ Fair distributions for more participants than allocations ⋮ Envy-free division of multi-layered cakes ⋮ Efficient Fair Division with Minimal Sharing ⋮ Envy-free division via configuration spaces ⋮ ENVY‐FREE DIVISION USING MAPPING DEGREE ⋮ Vanishing of all equivariant obstructions and the mapping degree ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Almost envy-free allocations with connected bundles ⋮ Splitting Necklaces, with Constraints ⋮ Counterexamples to the colorful Tverberg conjecture for hyperplanes ⋮ Envy-free division in the presence of a dragon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma
• Using volume to prove Sperner's Lemma
• On the complexity of 2D discrete fixed point problem
• Dividing a cake fairly
• Consensus-halving via theorems of Borsuk-Ulam and Tucker
• Topology of scrambled simplices
• Rental Harmony: Sperner's Lemma in Fair Division
• How to Cut a Cake Fairly
• Fair Division and Generalizations of Sperner- and KKM-type Results
• Achieving Rental Harmony with a Secretive Roommate
• Algorithmic Solutions for Envy-Free Cake Cutting
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Sperner's Colorings, Hypergraph Labeling Problems and Fair Division

This page was built for publication: Envy-free cake division without assuming the players prefer nonempty pieces