A Rule for Committee Selection with Soft Diversity Constraints
This addresses a common issue in committee selection for organizations or institutions, but it is incremental as it builds on existing formal approaches by introducing soft constraints.
The paper tackled the problem of committee selection with diversity constraints, which often faces computational intractability and infeasibility with hard constraints, by proposing a polynomial-time algorithm using soft bounds that satisfies natural axioms.
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.