The following pages link to Dividing a cake fairly (Q1160300):
Displayed 14 items.
- A combinatorial algorithm to establish a fair border (Q915733) (← links)
- A note on the cake-division problem (Q1075937) (← links)
- Sets on which several measures agree (Q1088802) (← links)
- Ramsey partitions of integers and fair divisions (Q1196689) (← links)
- On the fair division of a heterogeneous commodity (Q1198380) (← 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)
- Approximating fair division with a limited number of cuts (Q1903017) (← links)
- Liapounov's convexity theorem for topological measures (Q1924986) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- Equitable allocation of divisible goods (Q1966224) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
- On a theorem of Dvoretsky, Wald, and Wolfowitz concerning Liapounov Measures (Q3771056) (← links)
- The Dubins-Spanier optimization problem in fair division theory (Q5937176) (← links)