Voting methods balance candidate quality with fair group representation

Approval-Based Multiwinner Voting with Candidate Qualities

Computer Science and Game Theory

Summary

Choosing a group of winners often means picking popular candidates, but sometimes candidates also have different qualities. This paper studies how to select winners so that groups get fair representation while still picking high-quality candidates. The authors introduce new rules to balance these goals and show they can pick committees that keep much of the top quality without losing fairness. Their methods can find good groups efficiently, even when balancing these competing goals.

What this means in practice

  • For election system designers: Design voting systems that ensure fair group representation while selecting candidates with high qualities for committees.
  • For human resources teams: Select diverse and qualified candidate panels by balancing team member support and individual candidate credentials.

Authors

Niclas Boehmer, Chris Dong, Luca Kreisel, Markus Utke

Abstract

We initiate the study of a new model of approval-based multiwinner voting in which each candidate carries an exogenous quality score, capturing, for instance, the reliability of the candidate or their relevance to the context of the selection. Quality scores break with the standard assumption of approval-based multiwinner voting that candidates are fully defined by the set of their supporters. We rethink what proportional representation means in the presence of quality scores. For this, we introduce a threshold-based and a value-based family of axioms, analyze their relationships, satisfiability, and computational complexity, and present rules that achieve the strongest jointly satisfiable combinations of our proportionality axioms. We then analyze the compatibility of proportionality with the natural goal of maximizing the summed quality of the selected candidates. While imposing standard proportionality notions can lead to an almost complete loss of quality, we show that under a new class of reciprocal axioms, which scale a group's entitlement by the quality of its commonly approved candidate(s), there always exist proportional committees retaining at least 3/4 of the optimal summed quality, and such committees can be computed by our voting rules at no additional computational cost.