An algorithm for super envy-free cake division

DOI10.1006/JMAA.1999.6581zbMath0948.28006OpenAlexW1989218403MaRDI QIDQ1961037

William A. Webb

Publication date: 14 November 2000

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

Full work available at URL: https://doi.org/10.1006/jmaa.1999.6581

zbMATH Keywords

fair divisioncake divisionnonatomic probability measuresenvy-free partition

Mathematics Subject Classification ID

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

Related Items (2)

How to cut a cake with a Gram matrix ⋮ A comparison of formulations and solution methods for the minimum-envy location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on cake cutting
• Extensions of cut-and-choose fair division
• A note on the cake-division problem
• Sets on which several measures agree
• Dividing a cake fairly
• 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
• Old and new moving-knife schemes
• Super envy-free cake division and independence of measures
• On the possibilities for partitioning a cake
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly
• A moving-knife solution to the four-person envy-free cake-division problem
• An Envy-Free Cake Division Protocol
• Preference Relations and Measures in the Context of Fair Division
• Game-theoretic algorithms for fair and strongly fair cake division with entitlements
• A Note on the Fair Division Problem
• Sur la division pragmatique

This page was built for publication: An algorithm for super envy-free cake division