The theory of algorithmic fair allocation is at the center of multi-agent systems and
economics in recent decades due to its industrial and social importance. At a high level, the …

We study the problem of fair allocation of m indivisible items among n agents with additive
valuations using the popular notion of maximin share (MMS) as our measure of fairness. An …

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) …

In this article, we present new results on the fair and efficient allocation of indivisible goods
to agents whose preferences correspond to matroid rank functions. This is a versatile …

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

We consider the problem of fairly allocating a set of indivisible goods among $ n $ agents
with additive valuations, using the popular fairness notion of maximin share (MMS). Since …

Scientific advancement requires effective peer review. Papers should be reviewed by
experts in the subject area, but it is equally important that reviewer quality is fairly distributed …

In this paper, we present new results on the fair and efficient allocation of indivisible goods
to agents whose preferences correspond to matroid rank functions. This is a versatile …

We consider the problem of fairly allocating indivisible resources to agents, which has been
studied for years. Most previous work focuses on fairness and/or efficiency among agents …

We consider the classical fair division problem which studies how to allocate resources fairly
and efficiently. We give a complete landscape on the computational complexity and …