A lower bound for cake cutting

DOI10.1007/B13632MaRDI QIDQ5897268zbMATH OpenOpenAlexFDO

Authors Jiří Sgall, Gerhard J. Woeginger

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Noncooperative games (91A10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• On the complexity of cake cutting
• Cake cutting really is not a piece of cake
• scientific article; zbMATH DE number 3849005
• scientific article; zbMATH DE number 2119670
• scientific article; zbMATH DE number 1962847

Cited in

(7)

• On the complexity of cake cutting
• Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
• scientific article; zbMATH DE number 3849005 (Why is no real title available?)
• scientific article; zbMATH DE number 5598643 (Why is no real title available?)
• Cutting a Cake for Five People
• A Note on a Cake Cutting Algorithm of Banach and Knaster
• Cake cutting really is not a piece of cake

This page was built for publication: A lower bound for cake cutting

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