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 consider fair division of a set of indivisible goods among $ n $ agents with additive
valuations using the fairness notion of maximin share (MMS). MMS is the most popular …

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 …

We study the maximin share (MMS) fair allocation of $ m $ indivisible tasks to $ n $ agents
who have costs for completing the assigned tasks. It is known that exact MMS fairness …

We consider the problem of fairly allocating a sequence of indivisible items that arrive online
in an arbitrary order to a group of $ n $ agents with additive normalized valuation functions …

In this paper, we study dynamic multi-resource maximin share fair allocation based on the
elastic demands of users in a cloud computing system. In this problem, users do not stay in …

Proportionality (PROP) is one of the simplest and most intuitive fairness criteria used for
allocating items among agents with additive utilities. However, when the items are …

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 study the problem of allocating $ m $ indivisible chores to $ n $ agents with additive cost
functions under the fairness notion of maximin share (MMS). In this work, we propose a …