The complexity of envy-free graph cutting
From MaRDI portal
Cites work
- A refined laser method and faster matrix multiplication
- Algorithmic solutions for envy-free cake cutting
- Algorithms in real algebraic geometry
- Almost envy-free allocations with connected bundles
- Approximate envy-freeness in graphical cake cutting
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol
- Contiguous cake cutting: hardness results and approximation algorithms
- Distributed fair allocation of indivisible goods
- Dividing a graphical cake
- Envy-free division of discrete cakes
- Envy-free division of multilayered cakes
- Expand the shares together: envy-free mechanisms with a small number of cuts
- Fair and efficient cake division with connected pieces
- Fair division of graphs and of tangled cakes
- Fairly allocating contiguous blocks of indivisible items
- How to Cut a Cake Fairly
- How to Cut A Cake Fairly
- How to cut a cake fairly: a generalization to groups
- scientific article; zbMATH DE number 1234106 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- Lower Bounds for Approximation by Nonlinear Manifolds
- On total functions, existence theorems and computational complexity
- Rental Harmony: Sperner's Lemma in Fair Division
- Solving linear programs in the current matrix multiplication time
- Waste makes haste: bounded time algorithms for envy-free cake cutting with free disposal
This page was built for publication: The complexity of envy-free graph cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7323909)
