Pages that link to "Item:Q3115855"
From MaRDI portal
The following pages link to Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm (Q3115855):
Displaying 13 items.
- Distributed fair allocation of indivisible goods (Q343902) (← links)
- Two-person cake cutting: the optimal number of cuts (Q483349) (← links)
- The complexity of cake cutting with unequal shares (Q1617637) (← links)
- Resource-monotonicity and population-monotonicity in connected cake-cutting (Q1737122) (← links)
- Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← links)
- Cake-cutting with different entitlements: how many cuts are needed? (Q2325916) (← links)
- How to share a cake with a secret agent (Q2334821) (← links)
- Proportional pie-cutting (Q2482667) (← links)
- Fair multi-cake cutting (Q2659057) (← links)
- Fair cake-cutting in practice (Q2673204) (← links)
- Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations (Q2936971) (← links)
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol (Q5146918) (← links)
- Fair Division (Q5150295) (← links)