The following pages link to How to Cut a Cake Fairly (Q3883835):
Displaying 50 items.
- Rental harmony with roommates (Q406385) (← links)
- A note on envy-free cake cutting with polynomial valuations (Q477590) (← links)
- Dividing connected chores fairly (Q500994) (← links)
- How to divide the indivisible (Q521428) (← links)
- A note on cake cutting (Q595538) (← links)
- The efficiency of fair division (Q692886) (← links)
- Fair and efficient cake division with connected pieces (Q776236) (← links)
- Truthful fair division without free disposal (Q826615) (← links)
- Children crying at birthday parties. Why? (Q878403) (← links)
- A combinatorial algorithm to establish a fair border (Q915733) (← links)
- Strategic divide and choose (Q952777) (← links)
- Efficient egalitarian equivalent allocations over a single good (Q1016334) (← 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)
- A pie allocation among sharing groups (Q1384021) (← links)
- Asymptotic existence of fair divisions for groups (Q1680744) (← links)
- KKM type theorems with boundary conditions (Q1687173) (← links)
- Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← 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)
- Old and new moving-knife schemes (Q1903417) (← links)
- On the computability of equitable divisions (Q1926490) (← links)
- An algorithm for super envy-free cake division (Q1961037) (← links)
- Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting) (Q2044310) (← links)
- Allocating contiguous blocks of indivisible chores fairly (Q2051776) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Mind the gap: cake cutting with separation (Q2093384) (← links)
- Envy-free division in the presence of a dragon (Q2106889) (← links)
- Envy-free division of multi-layered cakes (Q2152142) (← links)
- Fair division of mixed divisible and indivisible goods (Q2238609) (← links)
- Envy-free cake division without assuming the players prefer nonempty pieces (Q2279957) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- Fair cake-cutting among families (Q2296036) (← links)
- Simple fair division of a square (Q2304202) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- The problem of fair division for a hybrid resource (Q2364476) (← links)
- Divide-and-permute (Q2387317) (← links)
- Existence of a simple and equitable fair division: a short proof (Q2406943) (← links)
- Envy-free two-player \(m\)-cake and three-player two-cake divisions (Q2450739) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
- Proportional pie-cutting (Q2482667) (← 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)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- Two birds with one stone: fairness and welfare via transfers (Q2670942) (← links)
- A near equitable 2-person cake cutting algorithm (Q3145047) (← links)
- Envy-Free Division of Land (Q3387907) (← links)
- Cutting a Cake for Five People (Q3638457) (← links)
- A moving-knife solution to the four-person envy-free cake-division problem (Q4332981) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)