Committee scoring voting rules are multiwinner analogues of positional scoring rules which constitute an important subclass of single-winner voting rules. We identify several natural subclasses of committee scoring rules, namely, weakly separable, representation-focused, top- @math -counting, OWA-based, and decomposable rules. We characterize SNTV, Bloc, and @math -Approval Chamberlin--Courant as the only nontrivial rules in pairwise intersections of these classes. We provide some axiomatic characterizations for these classes, where monotonicity properties appear to be especially useful. The class of decomposable rules is new to the literature. We show that it strictly contains the class of OWA-based rules and describe some of the applications of decomposable rules.
Naturally, there exist many interesting multiwinner rules beyond the class of committee scoring rules. These include, for example, Single Transferable Vote (see, e.g., the work of Tideman and Richardson @cite_29 ), a number of rules based on the Condorcet principle @cite_63 @cite_60 @cite_11 @cite_58 @cite_15 @cite_56 @cite_51 @cite_50 @cite_73 , Monroe's rule @cite_76 , and different variants of the rule invented by Phragm 'en @cite_32 @cite_87 @cite_40 @cite_82 @cite_4 . For an overview of electoral systems used to select committees of representatives in practice, we refer the reader to the book of Lijphart and Grofman @cite_71 .
@cite_4 @cite_73 @cite_60 @cite_87 @cite_82 @cite_29 @cite_76 @cite_32 @cite_56 @cite_40 @cite_63 @cite_50 @cite_71 @cite_15 @cite_58 @cite_51 @cite_11
2289435862 2338144305 2033267281 2949245628
We characterize the class of committee scoring rules that satisfy the fixed-majority criterion. In some sense, the committee scoring rules in this class are multiwinner analogues of the single-winner Plurality rule, which is uniquely characterized as the only single-winner scoring rule that satisfies the simple majority criterion. We find that, for most of the rules in our new class, the complexity of winner determination is high (i.e., the problem of computing the winners is NP-hard), but we also show some examples of polynomial-time winner determination procedures, exact and approximate. Committee scoring rules form a rich class of aggregators of voters' preferences for the purpose of selecting subsets of objects with desired properties, e.g., a shortlist of candidates for an interview, a representative collective body such as a parliament, or a set of locations for a set of public facilities. In the spirit of celebrated Young's characterization result that axiomatizes single-winner scoring rules, we provide an axiomatic characterization of multiwinner committee scoring rules. We show that committee scoring rules---despite forming a remarkably general class of rules---are characterized by the set of four standard axioms, anonymity, neutrality, consistency and continuity, and by one axiom specific to multiwinner rules which we call committee dominance. In the course of our proof, we develop several new notions and techniques. In particular, we introduce and axiomatically characterize multiwinner decision scoring rules, a class of rules that broadly generalizes the well-known majority relation. We generalize the idea of a Condorcet winner to committee elections to select a Condorcet committee of size m. As in the case of a Condorcet winner, the Condorcet committee need not exist. We adapt two methods to measure how far a set of m candidates is from being the Condorcet committee. In particular, we generalize a procedure proposed by Lewis Carroll for selecting the candidate that is closest to being the Condorcet winner to allow the selection of a committee. We also generalize Kemeny’s method, which gives a complete transitive ranking, to the selection of committees and show that it is closely related to the first method.We show that these methods lead to some surprising inconsistencies. For example, the committee of size k may be disjoint from the committee of size j or they may overlap in any manner, the committee arising from Carroll’s method may appear at any locations in the Kemeny ranking, and except for two highly restrictive cases, the members of the committee arising from Kemeny’s method may appear at any location in the Kemeny ranking. 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.