DeepAI AI Chat
Log In Sign Up

Complexity of Shift Bribery in Committee Elections

by   Robert Bredereck, et al.
Berlin Institute of Technology (Technische Universität Berlin)

We study the (parameterized) complexity of SHIFT BRIBERY for multiwinner voting rules. We focus on SNTV, Bloc, k-Borda, and Chamberlin-Courant, as well as on approximate variants of Chamberlin-Courant, since the original rule is NP-hard to compute. We show that SHIFT BRIBERY tends to be significantly harder in the multiwinner setting than in the single-winner one by showing settings where SHIFT BRIBERY is easy in the single-winner cases, but is hard (and hard to approximate) in the multiwinner ones. Moreover, we show that the non-monotonicity of those rules which are based on approximation algorithms for the Chamberlin-Courant rule sometimes affects the complexity of SHIFT BRIBERY.


page 1

page 2

page 3

page 4


Manipulability of Single Transferable Vote

For many voting rules, it is NP-hard to compute a successful manipulatio...

Algorithms for Destructive Shift Bribery

We study the complexity of Destructive Shift Bribery. In this problem, w...

An Efficient Generalized Shift-Rule for the Prefer-Max De Bruijn Sequence

One of the fundamental ways to construct De Bruijn sequences is by using...

A Quantitative Analysis of Multi-Winner Rules

To choose a multi-winner rule, i.e., a voting rule that selects a subset...

Multiplierless Design of Very Large Constant Multiplications in Cryptography

This brief addresses the problem of implementing very large constant mul...

On Choosing Committees Based on Approval Votes in the Presence of Outliers

We study the computational complexity of committee selection problem for...

Achieving Fully Proportional Representation: Approximability Results

We study the complexity of (approximate) winner determination under the ...