Game-theoretic algorithms for fair and strongly fair cake division with entitlements

DOI10.4064/CM-69-1-59-73MaRDI QIDQ4853044zbMATH OpenOpenAlexFDO

Authors Julius B. Barbanel

Publication date 3 December 1995

Published in Colloquium Mathematicum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/210327

zbMATH Keywords

cake divisionentitlement sequence

Mathematics Subject Classification ID

Measures on Boolean rings, measure algebras (28A60) (n)-person games, (n>2) (91A06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Cutting a cake for infinitely many guests
• scientific article; zbMATH DE number 1409181
• Extensions of cut-and-choose fair division
• Two applications of a theorem of Dvoretsky, Wald, and Wolfovits to cake division
• On the possibilities for partitioning a cake

Cited in

(15)

• The adjusted Knaster procedure under unequal entitlements.
• Old and new moving-knife schemes
• An algorithm for super envy-free cake division
• Mind the gap: cake cutting with separation
• Cutting a cake for infinitely many guests
• Cake-cutting with different entitlements: how many cuts are needed?
• Stochastic design in cake division problem
• Constructing a Fair Border
• A game of fair division with continuum of players
• Preference Relations and Measures in the Context of Fair Division
• scientific article; zbMATH DE number 1409181 (Why is no real title available?)
• Stochastic cake division protocol
• Fair Cake Division Under Monotone Likelihood Ratios
• Fairer than fair: sharp bounds for connected super-proportional cake cutting
• Cooperation in dividing the cake

This page was built for publication: Game-theoretic algorithms for fair and strongly fair cake division with entitlements

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