Pages that link to "Item:Q5891100"
From MaRDI portal
The following pages link to Envy-free division of discrete cakes (Q5891100):
Displaying 16 items.
- Envy-free cake divisions cannot be found by finite protocols (Q1010716) (← links)
- On envy-free cake division (Q1347261) (← links)
- Maximin share and minimax envy in fair-division problems. (Q1399324) (← links)
- The complexity of cake cutting with unequal shares (Q1617637) (← links)
- Envy-free division in the presence of a dragon (Q2106889) (← links)
- Fair division with multiple pieces (Q2192068) (← links)
- Two-player envy-free multi-cake division (Q2270332) (← links)
- Envy-free cake division without assuming the players prefer nonempty pieces (Q2279957) (← links)
- Envy-free two-player \(m\)-cake and three-player two-cake divisions (Q2450739) (← links)
- Proportional pie-cutting (Q2482667) (← links)
- On Envy-Free Cake Division (Q2757505) (← links)
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm (Q3115855) (← links)
- Meta-Envy-Free Cake-Cutting Protocols (Q3586108) (← links)
- Fair distributions for more participants than allocations (Q5049630) (← links)
- A discrete and bounded envy-free cake cutting protocol for four agents (Q5361851) (← links)
- Envy-free division of discrete cakes (Q5920328) (← links)