The existence of envy-freeness up to any good (EFX) allocations is a fundamental open
problem in discrete fair division. The goal is to determine the existence of an allocation of a …

We study envy freeness up to any good (EFX) in settings where valuations can be
represented via a graph of arbitrary size where vertices correspond to agents and edges to …

We study a fair division model where indivisible items arrive sequentially, and must be
allocated immediately and irrevocably. Previous work on online fair division has shown …

We study the problem of fairly allocating indivisible goods to agents with weights
corresponding to their entitlements. Previous work has shown that, when agents have binary …

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 consider the fundamental problem of fairly allocating a set of indivisible items among
agents having valuations that are represented by a multi-graph--here, agents appear as the …

We study fair division of indivisible chores among $ n $ agents with additive disutility
functions. Two well-studied fairness notions for indivisible items are envy-freeness up to …

We study the problem of finding fair allocations--EF1 and EFX--of indivisible goods with
orientations. In an orientation, every agent gets items from their own predetermined set. For …

We study the problem of dynamically allocating $ T $ indivisible items to $ n $ agents with
the restriction that the allocation is fair all the time. Due to the negative results to achieve …

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 …