scientific article; zbMATH DE number 1962847

MaRDI QIDQ4418684zbMATH OpenFDO

Authors Malik Magdon-Ismail, Costas Busch, Mukkai S. Krishnamoorthy

Publication date 11 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070596.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Cake cutting really is not a piece of cake
• Cutting a pie is not a piece of cake
• Cutting cakes carefully
• Better ways to cut a cake
• On the complexity of cake cutting
• Confidently Cutting a Cake into Approximately Fair Pieces
• Fair cake-cutting in practice
• scientific article; zbMATH DE number 2119670
• Fair multi-cake cutting

Cited in

(13)

• Slicing the pie
• Fair cake-cutting among families
• Cake-cutting with different entitlements: how many cuts are needed?
• On the complexity of cake cutting
• Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
• Thou shalt covet the average of thy neighbors' cakes
• Online cake cutting
• Algorithmic solutions for envy-free cake cutting
• How to solve the cake-cutting problem in sublinear time
• A silent duel over a cake
• Cake cutting really is not a piece of cake
• A lower bound for cake cutting
• The efficiency of fair division

This page was built for publication:

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