# Weighted Maxmin Fair Share Allocation of Indivisible Chores

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Jun 2019.

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

- [Improving the Bounds on Approximating Weighted Maximin Share for Chores](https://mlsanity.com/paper/2610.15520/) (2026)

## Abstract (arXiv)

We initiate the study of indivisible chore allocation for agents with asymmetric shares. The fairness concept we focus on is the weighted natural generalization of maxmin share: WMMS fairness and OWMMS fairness. We first highlight the fact that commonly used algorithms that work well for the allocation of goods to asymmetric agents, and even for chores to symmetric agents do not provide good approximations for allocation of chores to asymmetric agents under WMMS. As a consequence, we present a novel polynomial-time constant-approximation algorithm, via linear program, for OWMMS. For two special cases: the binary valuation case and the 2-agent case, we provide exact or better constant-approximation algorithms.