How to Cut a Cake Fairly
From MaRDI portal
Publication:3883835
DOI10.2307/2320951zbMath0441.90002WikidataQ29040241 ScholiaQ29040241MaRDI QIDQ3883835
Publication date: 1980
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2320951
91B06: Decision theory
Related Items
A moving-knife solution to the four-person envy-free cake-division problem, The Dubins-Spanier optimization problem in fair division theory, A note on cake cutting, Children crying at birthday parties. Why?, A combinatorial algorithm to establish a fair border, Strategic divide and choose, Efficient egalitarian equivalent allocations over a single good, On the fair division of a heterogeneous commodity, How to cut a cake fairly using a minimal number of cuts, A pie allocation among sharing groups, Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond, Approximating fair division with a limited number of cuts, Old and new moving-knife schemes, An algorithm for super envy-free cake division, Divide-and-permute, On the complexity of cake cutting, Proportional pie-cutting, Cutting a Cake for Five People