The fair allocation of resources to agents is a fundamental problem in society and has
received significant attention and rapid developments from the game theory and artificial …

The fair allocation of mixed goods, consisting of both divisible and indivisible goods, has
been a prominent topic of study in economics and computer science. We define an …

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 …

We consider the problem of fair allocation of m indivisible items to a group of n agents with
subsidy (money). Our work mainly focuses on the allocation of chores but most of our results …

The classic fair division problems assume the resources to be allocated are either divisible
or indivisible, or contain a mixture of both, but the agents always have a predetermined and …

We study the problem of minimizing a given symmetric strictly convex function over the
Minkowski sum of an integral base-polyhedron and an M-convex set. This problem has a …

We study the problem of fairly allocating indivisible goods among strategic agents.
Amanatidis et al. show that truthfulness is incompatible with any meaningful fairness notions …

We study the problem of fairly allocating either a set of indivisible goods or a set of mixed
divisible and indivisible goods (ie, mixed goods) to agents with additive utilities, taking the …

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 …

We consider the problem of fairly allocating a combination of divisible and indivisible goods.
While fairness criteria like envy-freeness (EF) and proportionality (PROP) can always be …