Dividing a cake fairly
From MaRDI portal
Publication:1160300
DOI10.1016/0022-247X(80)90225-5zbMath0476.28001WikidataQ59663878 ScholiaQ59663878MaRDI QIDQ1160300
Publication date: 1980
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
05A17: Combinatorial aspects of partitions of integers
05A05: Permutations, words, matrices
28A05: Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets
Related Items
The Dubins-Spanier optimization problem in fair division theory, A combinatorial algorithm to establish a fair border, A note on the cake-division problem, Sets on which several measures agree, Ramsey partitions of integers and fair divisions, On the fair division of a heterogeneous commodity, How to cut a cake fairly using a minimal number of cuts, Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond, Approximating fair division with a limited number of cuts, Liapounov's convexity theorem for topological measures, An algorithm for super envy-free cake division, Equitable allocation of divisible goods, On the complexity of cake cutting, On a theorem of Dvoretsky, Wald, and Wolfowitz concerning Liapounov Measures
Cites Work
