On the complexity of cake cutting
From MaRDI portal
Publication:2467132
DOI10.1016/J.DISOPT.2006.07.003zbMATH Open1163.91447OpenAlexW1975079208MaRDI QIDQ2467132FDOQ2467132
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
Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to Cut a Cake Fairly
- Dividing a cake fairly
- Title not available (Why is that?)
- A note on cake cutting
- A Note on the Fair Division Problem
- Title not available (Why is that?)
- A note on the cake-division problem
- How to cut a cake fairly using a minimal number of cuts
- Approximating fair division with a limited number of cuts
Cited In (18)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cake cutting: explicit examples for impossibility results
- How to share a cake with a secret agent
- Fair and square: cake-cutting in two dimensions
- Fair Division
- Title not available (Why is that?)
- A near equitable 2-person cake cutting algorithm
- On the computability of equitable divisions
- A note on envy-free cake cutting with polynomial valuations
- The efficiency of fair division
- Fair cake-cutting for imitative agents
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation Algorithms for Computing Maximin Share Allocations
- Mind the gap: cake cutting with separation
- Two's company, three's a crowd: consensus-halving for a constant number of agents
Recommendations
- The complexity of cake cutting with unequal shares π π
- The complexity of cake cutting with unequal shares π π
- Title not available (Why is that?) π π
- Cutting High-Dimensional Cakes π π
- How to cut a cake. And other mathematical conundrums π π
- Title not available (Why is that?) π π
- Cake Cutting Algorithms π π
- On the possibilities for partitioning a cake π π
- On partitioning a cake π π
- A lower bound for cake cutting π π
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)