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 …

Fair division is a longstanding problem in economics and has recently received substantial
interest in computer science. Several applications of fair division involve agents with …

Fair division considers the allocation of scarce resources among agents in such a way that
every agent gets a fair share. It is a fundamental problem in society and has received …

We study the problem of allocating a set of indivisible goods to a set of agents with additive
valuation functions, aiming to achieve approximate envy-freeness up to any good (α-EFX) …

We study the efficiency of fair allocations using the well-studied price of fairness concept,
which quantitatively measures the worst-case efficiency loss when imposing fairness …

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) …

The problem of fairly allocating a set of indivisible items is a well-known challenge in the
field of (computational) social choice. In this scenario, there is a fundamental incompatibility …

We investigate the existence of fair and efficient allocations of indivisible chores to
asymmetric agents who have unequal entitlements or weights. We consider the fairness …

We consider the problem of allocating $ m $ indivisible items to a set of $ n $ heterogeneous
agents, aiming at computing a proportional allocation by introducing subsidy (money). It has …

Fair allocation of indivisible goods has attracted extensive attention over the last two
decades, yielding numerous elegant algorithmic results and producing challenging open …