DeepAI AI Chat
Log In Sign Up

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

by   Jiehua Chen, et al.
TU Wien

Answering an open question by Betzler et al. [Betzler et al., JAIR'13], we resolve the parameterized complexity of the multi-winner determination problem under two famous representation voting rules: the Chamberlin-Courant (in short CC) rule [Chamberlin and Courant, APSR'83] and the Monroe rule [Monroe, APSR'95]. We show that under both rules, the problem is W[1]-hard with respect to the sum β of misrepresentations, thereby precluding the existence of any f(β) · |I|^O(1) -time algorithm, where |I| denotes the size of the input instance.


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...

More Effort Towards Multiagent Knapsack

In this paper, we study some multiagent variants of the knapsack problem...

Simple quadrature rules for a nonparametric nonconforming quadrilateral element

We introduce simple quadrature rules for the family of nonparametric non...

Robustness of Greedy Approval Rules

We study the robustness of GreedyCC, GreedyPAV, and Phargmen's sequentia...

Gerrymandering Trees: Parameterized Hardness

In a representative democracy, elections involve partitioning geographic...

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

We present an almost optimal algorithm for the classic Chamberlin-Couran...

Beyond the Worst Case: Semi-Random Complexity Analysis of Winner Determination

The computational complexity of winner determination is a classical and ...