On Envy-Free Cake Division

DOI10.2307/2695471MaRDI QIDQ2757505zbMATH OpenOpenAlexFDO

Authors Oleg Pikhurko

Publication date 26 November 2001

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2695471

zbMATH Keywords

cake divisionmeasurepartitionplayer

Mathematics Subject Classification ID

Partitions of sets (05A18) Contents, measures, outer measures, capacities (28A12) Noncooperative games (91A10)

Recommendations

• An Envy-Free Cake Division Protocol
• Envy-free cake divisions cannot be found by finite protocols
• On envy-free cake division
• Two-player envy-free multi-cake division
• Envy-free division of discrete cakes

Cited in

(9)

• Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
• Computer science and decision theory
• Cake cutting: explicit examples for impossibility results
• Equitable Candy Sharing
• Envy-free division of discrete cakes
• On cake dividing
• Fair Share
• Between proportionnality and envy-freeness: k-proportionality
• Envy-free cake cutting: a polynomial number of queries with high probability

This page was built for publication: On Envy-Free Cake Division

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