The following pages link to Old and new moving-knife schemes (Q1903417):
Displaying 11 items.
- How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) (Q439239) (← links)
- How to cut a cake fairly using a minimal number of cuts (Q1356520) (← links)
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond (Q1763188) (← links)
- On the computability of equitable divisions (Q1926490) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- A paradoxical Pareto frontier in the cake-cutting context (Q2573268) (← links)
- A near equitable 2-person cake cutting algorithm (Q3145047) (← links)
- A moving-knife solution to the four-person envy-free cake-division problem (Q4332981) (← links)
- On a method of obtaining exact fair divisions (Q5135651) (← links)
- Fairly taking turns (Q6148409) (← links)
- Dividing a graphical cake (Q6668347) (← links)
