We consider the problem of fairly allocating a set of indivisible goods among n agents.
Various fairness notions have been proposed within the rapidly growing field of fair division …

We consider the problem of fairly allocating a set of indivisible goods among n agents.
Various fairness notions have been proposed within the rapidly growing field of fair division …

A major problem in fair division is how to allocate a set of indivisible resources among
agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two …

We study fair division of indivisible goods in a single-parameter environment. In particular,
we develop truthful social welfare maximizing mechanisms for fairly allocating indivisible …

In fair division of indivisible goods, allocations that satisfy fairness and efficiency
simultaneously are highly desired but may not exist or, even if they do exist, are …

Fair division of resources is a fundamental problem in many disciplines, including computer
science, economy, operations research, etc. In the context of fair allocation of indivisible …

Fair division captures many real-world scenarios and plays an important role in many
research fields including computer science, economy, operations research, etc. For the …

We consider the problem of fairly dividing a collection of indivisible goods among a set of
players. Much of the existing literature on fair division focuses on notions of individual …

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 …

We study the problem of allocating indivisible goods among n agents in a fair manner. For
this problem, maximin share (MMS) is a well-studied solution concept which provides a …