A note on the cake-division problem
From MaRDI portal
Publication:1075937
DOI10.1016/0097-3165(86)90101-9zbMath0592.90023OpenAlexW1987698511MaRDI QIDQ1075937
Publication date: 1986
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(86)90101-9
Related Items
Cutting a cake for infinitely many guests, On envy-free cake division, How to cut a cake fairly using a minimal number of cuts, Approximating fair division with a limited number of cuts, A combinatorial algorithm to establish a fair border, An algorithm for super envy-free cake division, On the complexity of cake cutting
Cites Work
