Optimal Algorithms for Multiwinner Elections and the Chamberlin-Courant Rule

  title={Optimal Algorithms for Multiwinner Elections and the Chamberlin-Courant Rule},
  author={Kamesh Munagala and Zeyu Shen and Kangning Wang},
  journal={Proceedings of the 22nd ACM Conference on Economics and Computation},
We consider the algorithmic question of choosing a subset of candidates of a given size k from a set of m candidates, with knowledge of voters' ordinal rankings over all candidates. We consider the well-known and classic scoring rule for achieving diverse representation: the Chamberlin-Courant (CC) or 1-Borda rule, where the score of a committee is the average over the voters, of the rank of the best candidate in the committee for that voter; and its generalization to the average of the top s… 

Figures from this paper

Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results

A structural approach is developed that enables the development of polynomial-time algorithms to find trees with the smallest maximum degree, diameter, or pathwidth, but it is NP-hard to check whether a given profile is single-peaked on a tree that is isomorphic to a given tree, or on a regular tree.

Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space

Three polynomial-time approximation schemes are presented, each of which finds a committee of k candidates with provably good minimax score in multiwinner elections in Euclidean space using the minimax Chamberlin-Courant rule.

Approximate Core for Committee Selection via Multilinear Extension and Market Clearing

The main result is that an α-core, for α < 67.37, always exists when utilities of the voters are arbitrary monotone submodular functions, and this can be computed in polynomial time.



Approximately stable committee selection

It is shown that c = O(1) for all monotone preference structures, via showing an existence result for a randomized notion of stability, and iteratively rounding the resulting fractional solution.

Achieving fully proportional representation: Approximability results

Properties of multiwinner voting rules

This paper considers committee selection rules that can be viewed as generalizations of single-winner scoring rules, including SNTV, Bloc, k-Borda, STV, as well as several variants of the Chamberlin–Courant rule and the Monroe rule and their approximations.

Effective Heuristics for Committee Scoring Rules

An experimental evaluation of two novel heuristics for computing approximate results of multiwinner elections under arbitrary committee scoring rules uses the two-dimensional Euclidean domain to compare the visual representations of the outputs of the algorithms.

Proportional Approval Voting, Harmonic k-median, and Negative Association

The main result is that the harmonic sequence of weights, for which the objective function interpreted in a multiwinner election setup reflects to the well-known Proportional Approval Voting (PAV) rule, allows constant factor approximation.

Approximation Algorithms for BalancedCC Multiwinner Rules

A polynomial-time algorithm for computing a schedule that guarantees high approximation ratio, but it is shown that finding the best possible schedule for a given election is NP-hard.

Finding a collective set of items: From proportional multirepresentation to group recommendation

An analysis of approximations for maximizing submodular set functions—I

It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.

The expanding approvals rule: improving proportional representation and monotonicity

This paper presents a taxonomy of proportional representation axioms for general weak order preferences, some of which generalise and strengthen previously introduced concepts, and presents a rule called the expanding approvals rule (EAR) that satisfies properties stronger than the central PR axiom satisfied by STV.

Knapsack Voting for Participatory Budgeting

This work addresses the question of aggregating the preferences of voters in the context of participatory budgeting and introduces a novel scheme tailored to this setting, which is called “Knapsack Voting,” and shows that it is strategy-proof under a natural model of utility and “partially” strategy- proof under general additive utilities.