Super envy-free cake division and independence of measures

DOI10.1006/S0022-247X(96)90006-2MaRDI QIDQ1916698zbMATH OpenFDO

Authors Julius B. Barbanel

Publication date 14 July 1996

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/S0022-247X(96)90006-2

zbMATH Keywords

super envy-free cake division

Mathematics Subject Classification ID

Vector-valued set functions, measures and integrals (28B05) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• An algorithm for super envy-free cake division
• On envy-free cake division
• How to cut a cake with a Gram matrix
• scientific article; zbMATH DE number 1409181

Cited in

(12)

• Maximin share and minimax envy in fair-division problems.
• On the structure of Pareto optimal cake partitions
• How to cut a cake with a Gram matrix
• Consensus-halving via theorems of Borsuk-Ulam and Tucker
• An algorithm for super envy-free cake division
• On the possibilities for partitioning a cake
• Preference Relations and Measures in the Context of Fair Division
• Hardness results for consensus-halving
• On the geometry of cake division
• Fairer than fair: sharp bounds for connected super-proportional cake cutting
• Envy-free cake cutting: a polynomial number of queries with high probability
• A characterization of \(\alpha \)-maximin solutions of fair division problems

This page was built for publication: Super envy-free cake division and independence of measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916698)