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 …

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 …

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 the problem of allocating indivisible goods among agents with additive valuations
in a fair and efficient manner, when agents have few utility values for the goods. We consider …

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 how to fairly allocate a set of indivisible chores to a group of agents, where each
agent $ i $ has a non-negative weight $ w_i $ that represents its obligation for undertaking …

We consider the problem of fair allocation of indivisible chores under additive valuations. We
assume that the chores are divided into two types and under this scenario, we present …

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 …