Approximation and hardness of Shift-Bribery

Piotr Faliszewski; Pasin Manurangsi; Krzysztof Sornat

doi:10.1016/j.artint.2021.103520

Approximation and hardness of Shift-Bribery

Piotr Faliszewski
, Pasin Manurangsi
, Krzysztof Sornat

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

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.

Original language	English
Article number	103520
Journal	Artificial Intelligence
Volume	298
DOIs	https://doi.org/10.1016/j.artint.2021.103520
State	Published - 1 Sep 2021
Externally published	Yes

Keywords

Algorithms
Approximation
Elections
Hardness
Shift-Bribery

ASJC Scopus subject areas

Language and Linguistics
Linguistics and Language
Artificial Intelligence

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.artint.2021.103520

Cite this

@article{c0edc60062084b5bab58d33c5fe5ffaf,

title = "Approximation and hardness of Shift-Bribery",

abstract = "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.",

keywords = "Algorithms, Approximation, Elections, Hardness, Shift-Bribery",

author = "Piotr Faliszewski and Pasin Manurangsi and Krzysztof Sornat",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2021",

month = sep,

day = "1",

doi = "10.1016/j.artint.2021.103520",

language = "English",

volume = "298",

journal = "Artificial Intelligence",

issn = "0004-3702",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Approximation and hardness of Shift-Bribery

AU - Faliszewski, Piotr

AU - Manurangsi, Pasin

AU - Sornat, Krzysztof

PY - 2021/9/1

Y1 - 2021/9/1

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

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

KW - Algorithms

KW - Approximation

KW - Elections

KW - Hardness

KW - Shift-Bribery

UR - https://www.scopus.com/pages/publications/85105249984

U2 - 10.1016/j.artint.2021.103520

DO - 10.1016/j.artint.2021.103520

M3 - Article

AN - SCOPUS:85105249984

SN - 0004-3702

VL - 298

JO - Artificial Intelligence

JF - Artificial Intelligence

M1 - 103520

ER -

Approximation and hardness of Shift-Bribery

Abstract

Keywords

ASJC Scopus subject areas

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this