The following pages link to On envy-free cake division (Q1347261):
Displaying 13 items.
- A note on the cake-division problem (Q1075937) (← links)
- How to cut a cake fairly using a minimal number of cuts (Q1356520) (← links)
- Old and new moving-knife schemes (Q1903417) (← links)
- Super envy-free cake division and independence of measures (Q1916698) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- A paradoxical Pareto frontier in the cake-cutting context (Q2573268) (← links)
- Approximate envy-free procedures (Q2735143) (← links)
- On Envy-Free Cake Division (Q2757505) (← links)
- On the possibilities for partitioning a cake (Q3837575) (← links)
- A moving-knife solution to the four-person envy-free cake-division problem (Q4332981) (← links)
- Equitable Candy Sharing (Q4575389) (← links)
- On a method of obtaining exact fair divisions (Q5135651) (← links)
- Envy-free division of discrete cakes (Q5920328) (← links)