The following pages link to Fair multi-cake cutting (Q2659057):
Displaying 19 items.
- Two-person cake cutting: the optimal number of cuts (Q483349) (← links)
- How to cut a cake with a Gram matrix (Q1625485) (← links)
- Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← links)
- Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks (Q1755749) (← links)
- Mind the gap: cake cutting with separation (Q2093384) (← links)
- Envy-free division of multi-layered cakes (Q2152142) (← links)
- Two-player envy-free multi-cake division (Q2270332) (← links)
- Fair cake-cutting among families (Q2296036) (← links)
- Cake cutting: explicit examples for impossibility results (Q2334852) (← links)
- Fair cake-cutting in practice (Q2673204) (← links)
- Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations (Q2936971) (← links)
- Two-Person Pie-Cutting: The Fairest Cuts (Q2999716) (← links)
- (Q4418684) (← links)
- Fair distributions for more participants than allocations (Q5049630) (← links)
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
- Cutting a Cake Fairly for Groups Revisited (Q5880265) (← links)
- Keep your distance: land division with separation (Q6114476) (← links)
- Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)
- Dividing a graphical cake (Q6668347) (← links)
