We study the fundamental problem of fairly allocating a set of indivisible goods among n
agents with additive valuations using the desirable fairness notion of maximin share (MMS) …

We consider fair division of a set of indivisible goods among $ n $ agents with additive
valuations using the fairness notion of maximin share (MMS). MMS is the most popular …

We study best-of-both-worlds guarantees for the fair division of indivisible items among
agents with subadditive valuations. Our main result establishes the existence of a random …

We study the problem of computing\emph {fair} divisions of a set of indivisible goods among
agents with\emph {additive} valuations. For the past many decades, the literature has …

We study the problem of fairly allocating either a set of indivisible goods or a set of mixed
divisible and indivisible goods (ie, mixed goods) to agents with additive utilities, taking the …

We study the problem of mechanism design for allocating a set of indivisible items among
agents with private preferences on items. We are interested in such a mechanism that is …

We study the problem of allocating $ m $ indivisible chores to $ n $ agents with additive cost
functions under the fairness notion of maximin share (MMS). In this work, we propose a …

We consider the problem of fairly allocating a set of indivisible items under the criteria of the
maximin share guarantee. Specifically, we study approximation of maximin share allocations …

We study the fundamental problem of fairly dividing a set of indivisible items among agents
with (general) monotone valuations. The notion of envy-freeness up to any item (EFX) is …

We study the problem of fairly allocating indivisible goods among agents which are
equipped with {\em leveled} valuation functions. Such preferences, that have been studied …