On envy-free cake division
From MaRDI portal
Publication:1347261
DOI10.1016/0097-3165(95)90088-8zbMath0818.90035OpenAlexW1997976858MaRDI QIDQ1347261
Steven J. Brams, Alan D. Taylor
Publication date: 4 April 1995
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(95)90088-8
Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (6)
How to cut a cake fairly using a minimal number of cuts ⋮ Old and new moving-knife schemes ⋮ A moving-knife solution to the four-person envy-free cake-division problem ⋮ An algorithm for super envy-free cake division ⋮ On a method of obtaining exact fair divisions ⋮ A paradoxical Pareto frontier in the cake-cutting context
Cites Work
This page was built for publication: On envy-free cake division
