A Rule for Committee Selection with Soft Diversity Constraints
Artificial Intelligence
2018-04-02 v1
Abstract
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.
Cite
@article{arxiv.1803.11437,
title = {A Rule for Committee Selection with Soft Diversity Constraints},
author = {Haris Aziz},
journal= {arXiv preprint arXiv:1803.11437},
year = {2018}
}