Cake cutting really is not a piece of cake

DOI10.1145/2000807.2000819zbMath1295.68122OpenAlexW2066369985MaRDI QIDQ5895174

Jeff Edmonds, Kirk R. Pruhs

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2000807.2000819

zbMATH Keywords

fair divisioncake cutting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (9)

Ordinal Maximin Share Approximation for Goods ⋮ Fair cake-cutting for imitative agents ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ Dividing splittable goods evenly and with limited fragmentation ⋮ Fairly Allocating Many Goods with Few Queries ⋮ How to share a cake with a secret agent ⋮ Cake cutting: explicit examples for impossibility results ⋮ Mind the gap: cake cutting with separation ⋮ Computing Large Market Equilibria Using Abstractions

This page was built for publication: Cake cutting really is not a piece of cake