Pages that link to "Item:Q3145047"
From MaRDI portal
The following pages link to A near equitable 2-person cake cutting algorithm (Q3145047):
Displaying 7 items.
- The complexity of cake cutting with unequal shares (Q1617637) (← links)
- Resource-monotonicity and population-monotonicity in connected cake-cutting (Q1737122) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Two-Person Pie-Cutting: The Fairest Cuts (Q2999716) (← links)
- Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm (Q3115855) (← links)
- On a method of obtaining exact fair divisions (Q5135651) (← links)
- Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol (Q5146918) (← links)