On the complexity of cake cutting

DOI10.1016/j.disopt.2006.07.003zbMath1163.91447OpenAlexW1975079208MaRDI QIDQ2467132

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

fair divisioncake cutting

Mathematics Subject Classification ID

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

Related Items (12)

Fair and square: cake-cutting in two dimensions ⋮ Approximation Algorithms for Computing Maximin Share Allocations ⋮ On the computability of equitable divisions ⋮ Fair cake-cutting for imitative agents ⋮ A note on envy-free cake cutting with polynomial valuations ⋮ Fair Division ⋮ The efficiency of fair division ⋮ How to share a cake with a secret agent ⋮ Cake cutting: explicit examples for impossibility results ⋮ Mind the gap: cake cutting with separation ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents ⋮ A near equitable 2-person cake cutting algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on cake cutting
• A note on the cake-division problem
• Dividing a cake fairly
• How to cut a cake fairly using a minimal number of cuts
• Approximating fair division with a limited number of cuts
• How to Cut a Cake Fairly
• A Note on the Fair Division Problem

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