Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …

Allocating resources to individuals in a fair manner has been a topic of interest since the
ancient times, with most of the early rigorous mathematical work on the problem focusing on …

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 …

A major open question in fair allocation of indivisible items is whether there always exists an
allocation of chores that is Pareto optimal (PO) and envy-free up to one item (EF1). We …

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 fair allocation of indivisible goods and chores among agents with\emph
{lexicographic} preferences--a subclass of additive valuations. In sharp contrast to the goods …

We study the fair allocation of mixtures of indivisible goods and chores under lexicographic
preferences $\unicode {x2014} $ a subdomain of additive preferences. A prominent fairness …

We study the problem of fairly allocating a multiset M of m indivisible items among n agents
with additive valuations. Specifically, we introduce a parameter t for the number of distinct …

Fair division of indivisible resources has attracted significant attention from multi-agent
systems and computational social choice. Two popular solution concepts are envy-freeness …

We consider fair allocation of indivisible items in a model with goods, chores, and copies, as
a unified framework for studying:(1) the existence of EFX and other solution concepts for …