DeepAI AI Chat
Log In Sign Up

Approximation and Hardness of Shift-Bribery

08/28/2019
by   Piotr Faliszewski, et al.
0

In the Shift-Bribery problem we are given an election, a preferred candidate, and the costs of shifting this preferred candidate up the voters' preference orders. The goal is to find such a set of shifts that ensures that the preferred candidate wins the election. We give the first polynomial-time approximation scheme for the Shift-Bribery problem for the case of positional scoring rules, and for the Copeland rule we show strong inapproximability results.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/03/2018

Algorithms for Destructive Shift Bribery

We study the complexity of Destructive Shift Bribery. In this problem, w...
04/19/2021

Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules

We study the problem of bribery in multiwinner elections, for the case w...
08/04/2019

Interactive Visualisation of Hierarchical Quantitative Data: an Evaluation

We have compared three common visualisations for hierarchical quantitati...
05/26/2022

Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space

We consider multiwinner elections in Euclidean space using the minimax C...
01/30/2018

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...
11/28/2019

Manipulating Elections by Selecting Issues

Constructive election control considers the problem of an adversary who ...
01/30/2019

Comparing Election Methods Where Each Voter Ranks Only Few Candidates

Election rules are formal processes that aggregate voters preferences, t...