Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents

by   Tianze Wei, et al.

The real-world deployment of fair allocation algorithms usually involves a heterogeneous population of users, which makes it challenging for the users to get complete knowledge of the allocation except for their own bundles. Chan et al. [IJCAI 2019] proposed a new fairness notion, maximin-awareness (MMA), which guarantees that every agent is not the worst-off one, no matter how the items that are not allocated to her are distributed. We adapt and generalize this notion to the case of indivisible chores and when the agents may have arbitrary weights. Due to the inherent difficulty of MMA, we also consider its up to one and up to any relaxations. A string of results on the existence and computation of MMA related fair allocations, and their connections to existing fairness concepts is given.


page 1

page 2

page 3

page 4


A Little Charity Guarantees Almost Envy-Freeness

Fair division of indivisible goods is a very well-studied problem. The g...

Fair in the Eyes of Others

Envy-freeness is a widely studied notion in resource allocation, capturi...

Weighted Maxmin Fair Share Allocation of Indivisible Chores

We initiate the study of indivisible chore allocation for agents with as...

The Fair Value of Data Under Heterogeneous Privacy Constraints

Modern data aggregation often takes the form of a platform collecting da...

Unified Fair Allocation of Goods and Chores via Copies

We consider fair allocation of indivisible items in a model with goods, ...

Fair Division through Information Withholding

Envy-freeness up to one good (EF1) is a well-studied fairness notion for...

A note on the rationing of divisible and indivisible goods in a general network

The study of matching theory has gained importance recently with applica...

Please sign up or login with your details

Forgot password? Click here to reset