A moving-knife solution to the four-person envy-free cake-division problem
From MaRDI portal
Publication:4332981
DOI10.1090/S0002-9939-97-03614-9zbMath0861.90133OpenAlexW1493455308MaRDI QIDQ4332981
Steven J. Brams, William S. Zwicker, Alan D. Taylor
Publication date: 19 February 1997
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-97-03614-9
Related Items
How to cut a cake fairly using a minimal number of cuts ⋮ Old and new moving-knife schemes ⋮ Three Persons, Two Cuts: A New Cake-Cutting Algorithm ⋮ Fair division of graphs and of tangled cakes ⋮ How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) ⋮ An algorithm for super envy-free cake division ⋮ Fair Division ⋮ Dividing connected chores fairly ⋮ The efficiency of fair division ⋮ Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond ⋮ Unnamed Item ⋮ Allocating contiguous blocks of indivisible chores fairly ⋮ Consensus-halving via theorems of Borsuk-Ulam and Tucker ⋮ Envy-Free Division of Land ⋮ Cutting a Cake for Five People ⋮ Almost envy-free allocations with connected bundles ⋮ A paradoxical Pareto frontier in the cake-cutting context
Cites Work
