Properties of Multiwinner Voting Rules

2015/06/09 by Elkind, Edith, Faliszewski, Piotr, Skowron, Piotr +1 · 4 citations
#91B14 #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #I.2.11

paper · doi:10.48550/arxiv.1506.02891

Abstract

The goal of this paper is to propose and study properties of multiwinner voting rules which can be consider as generalisations of single-winner scoring voting rules. We consider SNTV, Bloc, k-Borda, STV, and several variants of Chamberlin--Courant's and Monroe's rules and their approximations. We identify two broad natural classes of multiwinner score-based rules, and show that many of the existing rules can be captured by one or both of these approaches. We then formulate a number of desirable properties of multiwinner rules, and evaluate the rules we consider with respect to these properties.

Cited by

• Spoiler Susceptibility in Party Elections
• Selecting Interlacing Committees
• Properties of Egalitarian Sequences of Committees: Theory and Experiments
• What Voting Rules Actually Do: A Data-Driven Analysis of Multi-Winner Voting

Related

• What Do Multiwinner Voting Rules Do? An Experiment Over the\n Two-Dimensional Euclidean Domain
• The Complexity of Multiwinner Voting Rules with Variable Number of Winners
• Multiwinner Analogues of Plurality Rule: Axiomatic and Algorithmic Perspectives
• Consistent Approval-Based Multi-Winner Rules
• On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules