Pages that link to "Item:Q3981356"
From MaRDI portal
The following pages link to Minimal number of cuts for fair division (Q3981356):
Displaying 13 items.
- How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) (Q439239) (← links)
- Two-person cake cutting: the optimal number of cuts (Q483349) (← links)
- 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)
- Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks (Q1755749) (← links)
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond (Q1763188) (← links)
- Approximating fair division with a limited number of cuts (Q1903017) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- Cake-cutting with different entitlements: how many cuts are needed? (Q2325916) (← links)
- How to share a cake with a secret agent (Q2334821) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
- A Muffin-Theorem Generator (Q3305733) (← links)