Pages that link to "Item:Q1903017"
From MaRDI portal
The following pages link to Approximating fair division with a limited number of cuts (Q1903017):
Displaying 14 items.
- Extensions of cut-and-choose fair division (Q677613) (← links)
- Ramsey partitions of integers and fair divisions (Q1196689) (← links)
- How to cut a cake fairly using a minimal number of cuts (Q1356520) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Cutting a cake for infinitely many guests (Q2121781) (← links)
- Fair cake-cutting among families (Q2296036) (← links)
- Cake-cutting with different entitlements: how many cuts are needed? (Q2325916) (← links)
- An approximation scheme for cake division with a linear number of cuts (Q2460623) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
- A Muffin-Theorem Generator (Q3305733) (← links)
- Minimal number of cuts for fair division (Q3981356) (← links)
- Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
- On a method of obtaining exact fair divisions (Q5135651) (← links)