The Fairness of Leximin in Allocation of Indivisible Chores

Understand

The leximin solution -- which selects an allocation that maximizes the minimum utility, then the second minimum utility, and so forth -- is known to provide EFX (envy-free up to any good) fairness guarantee in some contexts when allocating indivisible goods.

• However, it remains unknown how fair the leximin solution is when used to allocate indivisible chores.
• In this paper, we demonstrate that the leximin solution can be modified to also provide compelling fairness guarantees for the allocation of indivisible chores.
• First, we generalize the definition of the leximin solution.