Pages that link to "Item:Q1010716"
From MaRDI portal
The following pages link to Envy-free cake divisions cannot be found by finite protocols (Q1010716):
Displaying 27 items.
- How to divide the indivisible (Q521428) (← links)
- The efficiency of fair division (Q692886) (← links)
- Fair and efficient cake division with connected pieces (Q776236) (← links)
- Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← links)
- On the computability of equitable divisions (Q1926490) (← links)
- Mind the gap: cake cutting with separation (Q2093384) (← links)
- Envy-free division of multi-layered cakes (Q2152142) (← links)
- Fairness and efficiency in cake-cutting with single-peaked preferences (Q2180735) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- How to share a cake with a secret agent (Q2334821) (← links)
- Cake cutting: explicit examples for impossibility results (Q2334852) (← links)
- The problem of fair division for a hybrid resource (Q2364476) (← 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)
- A parametric worst-case approach to fairness in cooperative games with transferable utility (Q2699972) (← links)
- Envy-Free Division of Land (Q3387907) (← links)
- Three Persons, Two Cuts: A New Cake-Cutting Algorithm (Q5074213) (← links)
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
- How to Cut a Cake Fairly: A Generalization to Groups (Q5144503) (← links)
- Fair Division (Q5150295) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Fair Cake Division Under Monotone Likelihood Ratios (Q5868939) (← links)
- Cutting a Cake Fairly for Groups Revisited (Q5880265) (← links)
- Fairly allocating contiguous blocks of indivisible items (Q5894699) (← links)
- Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts (Q6065412) (← links)
- Approximate and strategyproof maximin share allocation of chores with ordinal preferences (Q6120928) (← links)
- On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)
