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 5 items.
- 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)
- Fair cake-cutting among families (Q2296036) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
