The following pages link to (Q4666929):
Displayed 26 items.
- Two-person cake cutting: the optimal number of cuts (Q483349) (← links)
- Children crying at birthday parties. Why? (Q878403) (← links)
- A characterization of \(\alpha \)-maximin solutions of fair division problems (Q930002) (← links)
- Efficient egalitarian equivalent allocations over a single good (Q1016334) (← links)
- How to cut a cake with a Gram matrix (Q1625485) (← links)
- On the existence of Pareto efficient and envy-free allocations (Q2025008) (← links)
- A brief history of social choice and welfare theory (Q2064124) (← links)
- Cutting a cake for infinitely many guests (Q2121781) (← links)
- Finding maxmin allocations in cooperative and competitive fair division (Q2259025) (← links)
- Monotonicity and competitive equilibrium in cake-cutting (Q2323302) (← links)
- How to share a cake with a secret agent (Q2334821) (← links)
- Cake cutting: explicit examples for impossibility results (Q2334852) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Existence of a simple and equitable fair division: a short proof (Q2406943) (← links)
- Existence of efficient envy-free allocations of a heterogeneous divisible commodity with nonadditive utilities (Q2453404) (← links)
- Proportional pie-cutting (Q2482667) (← links)
- Bounds for \(\alpha\)-optimal partitioning of a measurable space based on several efficient partitions (Q2512678) (← links)
- A paradoxical Pareto frontier in the cake-cutting context (Q2573268) (← links)
- Fair cake-cutting for imitative agents (Q2673785) (← links)
- Nash Social Welfare Approximation for Strategic Agents (Q5031018) (← links)
- Fair distributions for more participants than allocations (Q5049630) (← links)
- A survey of mass partitions (Q5067418) (← links)
- Three Persons, Two Cuts: A New Cake-Cutting Algorithm (Q5074213) (← links)
- Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
- Fair Division (Q5150295) (← links)
- Fair division of goods in the shadow of market values (Q6109822) (← links)