On the complexity of cake cutting

DOI10.1016/J.DISOPT.2006.07.003MaRDI QIDQ2467132zbMATH OpenOpenAlexFDO

Authors Jiří Sgall, Gerhard J. Woeginger

Publication date 18 January 2008

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2006.07.003

zbMATH Keywords

cake cuttingfair division

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• scientific article; zbMATH DE number 5598643
• Cutting High-Dimensional Cakes
• How to cut a cake. And other mathematical conundrums
• scientific article; zbMATH DE number 3849005
• Cake cutting algorithms
• On the possibilities for partitioning a cake
• On partitioning a cake
• A lower bound for cake cutting

Cites work

• A note on cake cutting
• A note on the cake-division problem
• A Note on the Fair Division Problem
• Approximating fair division with a limited number of cuts
• Dividing a cake fairly
• How to Cut a Cake Fairly
• How to cut a cake fairly using a minimal number of cuts
• scientific article; zbMATH DE number 21741 (Why is no real title available?)
• scientific article; zbMATH DE number 1234106 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• scientific article; zbMATH DE number 1962847 (Why is no real title available?)

Cited in

(29)

• On the computability of equitable divisions
• Mind the gap: cake cutting with separation
• Two's company, three's a crowd: consensus-halving for a constant number of agents
• How to share a cake with a secret agent
• Cake cutting: explicit examples for impossibility results
• Fair and square: cake-cutting in two dimensions
• An approximation scheme for cake division with a linear number of cuts
• Fair cake-cutting for imitative agents
• Thou shalt covet the average of thy neighbors' cakes
• A doubly exponentially crumbled cake
• A near equitable 2-person cake cutting algorithm
• scientific article; zbMATH DE number 3849005 (Why is no real title available?)
• scientific article; zbMATH DE number 5598643 (Why is no real title available?)
• Approximation algorithms for computing maximin share allocations
• scientific article; zbMATH DE number 3914019 (Why is no real title available?)
• scientific article; zbMATH DE number 21741 (Why is no real title available?)
• scientific article; zbMATH DE number 1947449 (Why is no real title available?)
• scientific article; zbMATH DE number 1962847 (Why is no real title available?)
• A note on envy-free cake cutting with polynomial valuations
• scientific article; zbMATH DE number 2119670 (Why is no real title available?)
• Fair Division
• scientific article; zbMATH DE number 7662165 (Why is no real title available?)
• Cake cutting really is not a piece of cake
• A lower bound for cake cutting
• Envy-free cake-cutting for four agents
• The efficiency of fair division
• The circular balancing problem
• Fairer than fair: sharp bounds for connected super-proportional cake cutting
• Envy-free cake cutting: a polynomial number of queries with high probability

This page was built for publication: On the complexity of cake cutting

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