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 …

Wherever there is group life, there has been a social division of labor and resource
allocation, since ancient times. Examples include ant colonies, bee colonies, and wolf …

In this paper, we study how to fairly allocate a set of m indivisible chores to a group of n
agents, each of which has a general additive cost function on the items. Since envy-free (EF) …

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 …

One of the most important topics in discrete fair division is whether an EFX allocation exists
for any instance. Although the existence of EFX allocations is a standing open problem for …

We consider a novel setting where a set of items is matched to the same set of agents
repeatedly over multiple rounds. Each agent gets exactly one item per round, which brings …

We consider the problem of fairly and efficiently allocating indivisible items (goods or bads)
under capacity constraints. In this setting, we are given a set of categorized items. Each …

We study the problem of fairly allocating a set of chores to a group of agents. The existence
of envy-free up to any item (EFX) allocations is a long-standing open question for both …

Fair distribution of indivisible tasks with non-positive valuations (aka chores) has given rise
to a large body of work in recent years. A popular approximate fairness notion is envy …

Fairness and efficiency have become the pillars of modern fair division research, but prior
work on achieving both simultaneously is largely limited to the unconstrained setting. We …