# An Algorithmic Framework for Approximating Maximin Share Allocation of Chores

arXiv: https://arxiv.org/abs/1907.04505 · HTML: https://mlsanity.com/paper/1907.04505/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Jul 2019.

## Built on by (most cited first, 2 of 2)

- [Fair Shares: Feasibility, Domination and Incentives](https://mlsanity.com/paper/2205.07519/) (2022)
- [(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna](https://mlsanity.com/paper/2202.02672/) (2022)

## Abstract (arXiv)

In this paper, we consider the problem of how to fairly dividing m indivisible chores among n agents. The fairness measure we considered here is the maximin share. The previous best known result is that there always exists a frac43 approximation maximin share allocation. With a novel algorithm, we can always find a frac119 approximation maximin share allocation for any instances. We also discuss how to improve the efficiency of the algorithm and its connection to the job scheduling problem.