Truthful Fair Division

DOI10.1007/978-3-642-16170-4_25zbMath1310.91083OpenAlexW3105913011WikidataQ59663884 ScholiaQ59663884MaRDI QIDQ3162527

Elchanan Mossel, Omer Tamuz

Publication date: 19 October 2010

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/71908/

zbMATH Keywords

fair divisioncake cuttingtruthful mechanisms

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (11)

Fair and square: cake-cutting in two dimensions ⋮ Truthful fair division without free disposal ⋮ Anti-compacts and their applications to analogs of Lyapunov and Lebesgue theorems in Fréchet spaces ⋮ A heuristic optimization of Bayesian incentive-compatible cake-cutting ⋮ Fair cake-cutting in practice ⋮ Sequential analogues of the Lyapunov and Krein-Milman theorems in Fréchet spaces ⋮ Fairly taking turns ⋮ On existence of truthful fair cake cutting mechanisms ⋮ The return function: a new computable perspective on Bayesian-Nash equilibria ⋮ Obvious manipulations in cake-cutting ⋮ Fair Cake Division Under Monotone Likelihood Ratios

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Truth, justice, and cake cutting
• On Low-Envy Truthful Allocations
• How to Cut A Cake Fairly
• Sur la division pragmatique

This page was built for publication: Truthful Fair Division