Pages that link to "Item:Q1075937"
From MaRDI portal
The following pages link to A note on the cake-division problem (Q1075937):
Displaying 17 items.
- A combinatorial algorithm to establish a fair border (Q915733) (← links)
- On envy-free cake division (Q1347261) (← links)
- How to cut a cake fairly using a minimal number of cuts (Q1356520) (← links)
- Two applications of a theorem of Dvoretsky, Wald, and Wolfovits to cake division (Q1371444) (← links)
- On the structure of Pareto optimal cake partitions (Q1567188) (← links)
- Approximating fair division with a limited number of cuts (Q1903017) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- Cutting a cake for infinitely many guests (Q2121781) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
- On the existence of equitable cake divisions (Q2510174) (← links)
- Stochastic design in cake division problem (Q2854281) (← links)
- (Q3393566) (← links)
- (Q3690522) (← links)
- On the possibilities for partitioning a cake (Q3837575) (← links)
- On a method of obtaining exact fair divisions (Q5135651) (← links)
- Discrete and Computational Geometry (Q5897089) (← links)
- On the geometry of cake division (Q5957172) (← links)