Pages that link to "Item:Q2270332"
From MaRDI portal
The following pages link to Two-player envy-free multi-cake division (Q2270332):
Displaying 18 items.
- Nash-implementation of the no-envy solution on symmetric domains of economies (Q738934) (← links)
- Envy-free cake divisions cannot be found by finite protocols (Q1010716) (← links)
- Vilfredo Pareto cuts the cake (Q1804347) (← links)
- Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting) (Q2044310) (← links)
- Envy-free division in the presence of a dragon (Q2106889) (← links)
- Envy-free division of multi-layered cakes (Q2152142) (← links)
- Fair division with multiple pieces (Q2192068) (← 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)
- A paradoxical Pareto frontier in the cake-cutting context (Q2573268) (← links)
- Fair multi-cake cutting (Q2659057) (← links)
- Multi resource allocation with partial preferences (Q2680798) (← links)
- On Envy-Free Cake Division (Q2757505) (← links)
- Fair distributions for more participants than allocations (Q5049630) (← links)
- Generalized Rental Harmony (Q5075869) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Envy-free division of discrete cakes (Q5891100) (← links)
- Envy-free division of discrete cakes (Q5920328) (← links)