The following pages link to Dividing a cake fairly (Q1160300):
Displaying 38 items.
- How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) (Q439239) (← links)
- 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)
- Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting) (Q2044310) (← links)
- Envy-free division in the presence of a dragon (Q2106889) (← links)
- Envy-free division of multi-layered cakes (Q2152142) (← links)
- Envy-free cake division without assuming the players prefer nonempty pieces (Q2279957) (← links)
- Simple fair division of a square (Q2304202) (← links)
- How to share a cake with a secret agent (Q2334821) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Existence of a simple and equitable fair division: a short proof (Q2406943) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting (Q2629532) (← links)
- Fair multi-cake cutting (Q2659057) (← links)
- Two birds with one stone: fairness and welfare via transfers (Q2670942) (← links)
- On a theorem of Dvoretsky, Wald, and Wolfowitz concerning Liapounov Measures (Q3771056) (← links)
- Splitting Necklaces, with Constraints (Q4997130) (← links)
- Fair distributions for more participants than allocations (Q5049630) (← links)
- How to Cut a Cake Fairly: A Generalization to Groups (Q5144503) (← links)
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications (Q5234532) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Cutting a Cake Fairly for Groups Revisited (Q5880265) (← links)
- Envy-free division of discrete cakes (Q5920328) (← links)
- The Dubins-Spanier optimization problem in fair division theory (Q5937176) (← links)
- Envy-free division via configuration spaces (Q6044500) (← links)
- On guarantees, vetoes, and random dictators (Q6053649) (← links)
- Fair division of graphs and of tangled cakes (Q6120940) (← links)
- Cutting cakes and kissing circles (Q6169272) (← links)
- A sparse colorful polytopal KKM theorem (Q6204766) (← links)
