Super envy-free cake division and independence of measures
From MaRDI portal
Publication:1916698
DOI10.1006/S0022-247X(96)90006-2zbMath0857.90019MaRDI QIDQ1916698
Publication date: 14 July 1996
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Vector-valued set functions, measures and integrals (28B05) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (9)
How to cut a cake with a Gram matrix ⋮ Maximin share and minimax envy in fair-division problems. ⋮ Unnamed Item ⋮ An algorithm for super envy-free cake division ⋮ A characterization of \(\alpha \)-maximin solutions of fair division problems ⋮ On the possibilities for partitioning a cake ⋮ On the geometry of cake division ⋮ Consensus-halving via theorems of Borsuk-Ulam and Tucker ⋮ On the structure of Pareto optimal cake partitions
This page was built for publication: Super envy-free cake division and independence of measures
