Voting and Bribing in Single-Exponential Time

12/05/2018
by   Dušan Knop, et al.
0

We introduce a general problem about bribery in voting systems. In the R-Multi-Bribery problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate wins the perturbed election under the voting rule R. Voters assign prices for withdrawing their vote, for swapping the positions of two consecutive candidates in their preference order, and for perturbing their approval count to favour candidates. As our main result, we show that R-Multi-Bribery is fixed-parameter tractable parameterized by the number of candidates for many natural voting rules R, including Kemeny rule, all scoring protocols, maximin rule, Bucklin rule, fallback rule, SP-AV, and any C1 rule. In particular, our result resolves the parameterized complexity of R-Swap Bribery for all those voting rules, thereby solving a long-standing open problem and "Challenge #2" of the "Nine Research Challenges in Computational Social Choice" by Bredereck et al. Further, our algorithm runs in single-exponential time for arbitrary cost; it thus improves the earlier double-exponential time algorithm by Dorn and Schlotter that is restricted to the uniform-cost case for all scoring protocols, the maximin rule, and Bucklin rule.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2022

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], ...
research
01/29/2018

A Unifying Framework for Manipulation Problems

Manipulation models for electoral systems are a core research theme in s...
research
12/29/2022

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

We present an almost optimal algorithm for the classic Chamberlin-Couran...
research
03/05/2021

Fine-Grained Complexity and Algorithms for the Schulze Voting Method

We study computational aspects of a well-known single-winner voting rule...
research
06/20/2023

Nearly Optimal Committee Selection For Bias Minimization

We study the model of metric voting proposed by Feldman et al. [2020]. I...
research
11/13/2015

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

We study the computational complexity of committee selection problem for...
research
02/28/2022

Sampling-Based Winner Prediction in District-Based Elections

In a district-based election, we apply a voting rule r to decide the win...

Please sign up or login with your details

Forgot password? Click here to reset