The following pages link to Truth, justice, and cake cutting (Q380933):
Displaying 29 items.
- Dissolving a partnership dynamically (Q337803) (← links)
- Anti-compacts and their applications to analogs of Lyapunov and Lebesgue theorems in Fréchet spaces (Q341456) (← links)
- A heuristic optimization of Bayesian incentive-compatible cake-cutting (Q342509) (← links)
- Strategyproof mechanism design for facility location games with weighted agents on a line (Q489723) (← links)
- Truthful fair division without free disposal (Q826615) (← links)
- Sequential analogues of the Lyapunov and Krein-Milman theorems in Fréchet spaces (Q1683196) (← links)
- Expand the shares together: envy-free mechanisms with a small number of cuts (Q1739119) (← links)
- Hotelling competition and the gamma distribution (Q1792575) (← links)
- Allocating contiguous blocks of indivisible chores fairly (Q2051776) (← links)
- Obvious manipulations in cake-cutting (Q2103594) (← links)
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness (Q2152111) (← links)
- Dissolving a partnership securely (Q2175968) (← links)
- Fair division of mixed divisible and indivisible goods (Q2238609) (← links)
- The return function: a new computable perspective on Bayesian-Nash equilibria (Q2312340) (← links)
- Cake cutting: explicit examples for impossibility results (Q2334852) (← links)
- A unifying learning framework for building artificial game-playing agents (Q2350032) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting (Q2629532) (← links)
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
- Fair cake-cutting in practice (Q2673204) (← links)
- Truthful Fair Division (Q3162527) (← links)
- Envy-Free Division of Land (Q3387907) (← links)
- Revenue Maximizing Markets for Zero-Day Exploits (Q4571149) (← links)
- Computing Large Market Equilibria Using Abstractions (Q5031015) (← links)
- Fair Cake Division Under Monotone Likelihood Ratios (Q5868939) (← 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)
- Fairly taking turns (Q6148409) (← links)
- On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)
