A Note on a Cake Cutting Algorithm of Banach and Knaster

DOI10.2307/2974584MaRDI QIDQ4339332zbMATH OpenOpenAlexFDO

Authors Martin L. Jones

Publication date 3 July 1997

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

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

zbMATH Keywords

nonatomic probability measure

Mathematics Subject Classification ID

Probability measures on topological spaces (60B05) Probability theory on linear topological spaces (60B11)

Recommendations

• An approximation scheme for cake division with a linear number of cuts
• scientific article; zbMATH DE number 1947449
• Contiguous cake cutting: hardness results and approximation algorithms
• A lower bound for cake cutting
• Cake cutting algorithms for piecewise constant and piecewise uniform valuations
• scientific article; zbMATH DE number 1574595
• A remark on the slicing problem
• A protocol for cutting matroids like cakes
• Cake cutting algorithms
• Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

Cited in

(2)

• Cutting High-Dimensional Cakes
• A general Hobby-Rice theorem and cake cutting

This page was built for publication: A Note on a Cake Cutting Algorithm of Banach and Knaster

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