On Truthful Mechanisms for Maximin Share Allocations

13 May 2016 Amanatidis Georgios Birmpas Georgios Markakis Evangelos

We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition the items in any way she prefers, into $n$ bundles, and then receive her least desirable bundle... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTER SCIENCE AND GAME THEORY