# A Rule for Committee Selection with Soft Diversity Constraints

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

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Mar 2018.

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

- [Online Selection of Diverse Committees](https://mlsanity.com/paper/2105.09295/) (2021)
- [A General Theory of Proportionality with Additive Utilities](https://mlsanity.com/paper/2602.08504/) (2026)

## Abstract (arXiv)

Committee selection with diversity or distributional constraints is a ubiquitous problem. However, many of the formal approaches proposed so far have certain drawbacks including (1) computationally intractability in general, and (2) inability to suggest a solution for certain instances where the hard constraints cannot be met. We propose a practical and polynomial-time algorithm for diverse committee selection that draws on the idea of using soft bounds and satisfies natural axioms.