Old and new moving-knife schemes

DOI10.1007/BF03024785zbMath0837.90125MaRDI QIDQ1903417

William S. Zwicker, Alan D. Taylor, Steven J. Brams

Publication date: 29 November 1995

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

zbMATH Keywords

fair divisionproportionalitymaximin strategiescake-cuttingenvyfreenessmoving- knife proceduresrules of play

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06)

Related Items (10)

How to cut a cake fairly using a minimal number of cuts ⋮ On the computability of equitable divisions ⋮ Fairly taking turns ⋮ A moving-knife solution to the four-person envy-free cake-division problem ⋮ How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) ⋮ An algorithm for super envy-free cake division ⋮ On a method of obtaining exact fair divisions ⋮ Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond ⋮ A paradoxical Pareto frontier in the cake-cutting context ⋮ A near equitable 2-person cake cutting algorithm

Cites Work

• Sets on which several measures agree
• On envy-free cake division
• The Stadtgottesacker in Halle
• 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
• Game-theoretic algorithms for fair and strongly fair cake division with entitlements
• A Note on the Fair Division Problem
• Sur la division pragmatique
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Old and new moving-knife schemes