The following pages link to (Q5450059):
Displaying 21 items.
- Two-person cake cutting: the optimal number of cuts (Q483349) (← links)
- How to divide the indivisible (Q521428) (← links)
- Dividing profits three ways: exactness vs. consensuality (Q656777) (← links)
- Three-agent peer evaluation (Q1046309) (← 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)
- On the computability of equitable divisions (Q1926490) (← links)
- Obvious manipulations in cake-cutting (Q2103594) (← links)
- Measures of balance in combinatorial optimization (Q2168777) (← links)
- Fair-by-design matching (Q2212506) (← links)
- The problem of fair division for a hybrid resource (Q2364476) (← links)
- How to allocate hard candies fairly (Q2463574) (← links)
- Proportional pie-cutting (Q2482667) (← links)
- Fair cake-cutting in practice (Q2673204) (← links)
- Multi resource allocation with partial preferences (Q2680798) (← links)
- Revenue Maximizing Markets for Zero-Day Exploits (Q4571149) (← links)
- Three Persons, Two Cuts: A New Cake-Cutting Algorithm (Q5074213) (← links)
- Disproportionate division (Q5135364) (← links)
- Envy-free division of discrete cakes (Q5891100) (← links)
- Envy-free division of discrete cakes (Q5920328) (← links)
- On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)