Pages that link to "Item:Q4332981"
From MaRDI portal
The following pages link to A moving-knife solution to the four-person envy-free cake-division problem (Q4332981):
Displaying 18 items.
- How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) (Q439239) (← links)
- Dividing connected chores fairly (Q500994) (← links)
- The efficiency of fair division (Q692886) (← 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)
- Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715) (← links)
- Old and new moving-knife schemes (Q1903417) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- Allocating contiguous blocks of indivisible chores fairly (Q2051776) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- A paradoxical Pareto frontier in the cake-cutting context (Q2573268) (← links)
- Envy-Free Division of Land (Q3387907) (← links)
- Cutting a Cake for Five People (Q3638457) (← links)
- Three Persons, Two Cuts: A New Cake-Cutting Algorithm (Q5074213) (← links)
- (Q5090386) (← links)
- Fair Division (Q5150295) (← links)
- Fair division of graphs and of tangled cakes (Q6120940) (← links)
- The Texas shoot-out under Knightian uncertainty (Q6584583) (← links)
