We consider the problem of fairly allocating indivisible goods, focusing on a recently
introduced notion of fairness called maximin share guarantee: each player's value for his …

As introduced in Chapter 11 (Thomson, 2015), Fair Division refers to the general problem of
fairly dividing a common resource among agents having different—and sometimes …

We investigate five different fairness criteria in a simple model of fair resource allocation of
indivisible goods based on additive preferences. We show how these criteria are connected …

We study the problem of computing maximin share allocations, a recently introduced
fairness notion. Given a set of n agents and a set of goods, the maximin share of an agent is …

Fair division problems have attracted the attention of various scientific disciplines in the last
decades, including among others, mathematics, economics, computer science, and political …

We consider the problem of fairly allocating indivisible goods, focusing on a recently-
introduced notion of fairness called maximin share guarantee: Each player's value for his …

1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …

We study the mechanism design problem of allocating a set of indivisible items without
monetary transfers. Despite the vast literature on this very standard model, it still remains …

Fair allocation of indivisible goods has attracted extensive attention over the last two
decades, yielding numerous elegant algorithmic results and producing challenging open …

We study the problem of allocating indivisible goods among strategic agents. We focus on
settings wherein monetary transfers are not available and each agent's private valuation is a …