DeepAI AI Chat
Log In Sign Up

Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules

by   Krzysztof Sornat, et al.

We present an almost optimal algorithm for the classic Chamberlin-Courant multiwinner voting rule (CC) on single-peaked preference profiles. Given n voters and m candidates, it runs in almost linear time in the input size, improving the previous best O(nm^2) time algorithm of Betzler et al. (2013). We also study multiwinner voting rules on nearly single-peaked preference profiles in terms of the candidate-deletion operation. We show a polynomial-time algorithm for CC where a given candidate-deletion set D has logarithmic size. Actually, our algorithm runs in 2^|D|· poly(n,m) time and the base of the power cannot be improved under the Strong Exponential Time Hypothesis. We also adapt these results to all non-constant Thiele rules which generalize CC with approval ballots.


page 1

page 2

page 3

page 4


Voting and Bribing in Single-Exponential Time

We introduce a general problem about bribery in voting systems. In the R...

The Complexity of the Possible Winner Problem over Partitioned Preferences

The Possible-Winner problem asks, given an election where the voters' pr...

Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule

Answering an open question by Betzler et al. [Betzler et al., JAIR'13], ...

Fine-Grained Complexity and Algorithms for the Schulze Voting Method

We study computational aspects of a well-known single-winner voting rule...

Strong Coresets for Subspace Approximation and k-Median in Nearly Linear Time

Recently the first (1+ϵ)-approximate strong coresets for k-median and su...

Robustness Among Multiwinner Voting Rules

We investigate how robust are results of committee elections to small ch...

Strategic Voting in the Context of Negotiating Teams

A negotiating team is a group of two or more agents who join together as...