Pages that link to "Item:Q677613"
From MaRDI portal
The following pages link to Extensions of cut-and-choose fair division (Q677613):
Displaying 19 items.
- Two-person cake cutting: the optimal number of cuts (Q483349) (← links)
- Fair choice sequences (Q1639604) (← links)
- When \textit{I cut, you choose} method implies intransitivity (Q1783143) (← links)
- The adjusted Knaster procedure under unequal entitlements. (Q1862744) (← links)
- Approximating fair division with a limited number of cuts (Q1903017) (← links)
- Old and new moving-knife schemes (Q1903417) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- Cutting a cake for infinitely many guests (Q2121781) (← links)
- The fair division of hereditary set systems (Q2190407) (← links)
- Cake-cutting with different entitlements: how many cuts are needed? (Q2325916) (← links)
- How to share a cake with a secret agent (Q2334821) (← links)
- Existence of a simple and equitable fair division: a short proof (Q2406943) (← links)
- Impartial division of a dollar (Q2475176) (← links)
- How to cut a pizza fairly: fair division with decreasing marginal evaluations (Q2568812) (← links)
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting (Q2629532) (← links)
- Fair cake-cutting for imitative agents (Q2673785) (← links)
- Stochastic design in cake division problem (Q2854281) (← links)
- Minimal number of cuts for fair division (Q3981356) (← links)
- Cutting a Cake Fairly for Groups Revisited (Q5880265) (← links)