License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2017.46
URN: urn:nbn:de:0030-drops-69885
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/6988/
Go to the corresponding LIPIcs Volume Portal

Knop, Dusan ; Koutecký, Martin ; Mnich, Matthias

Voting and Bribing in Single-Exponential Time

pdf-format:
LIPIcs-STACS-2017-46.pdf (0.6 MB)

Abstract

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 manipulated 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 for a candidate.

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 of R-Swap Bribery for all those voting rules, thereby solving a long-standing open problem and "Challenge #2" of the 9 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 unit-cost case for all scoring protocols, the maximin rule, and Bucklin rule.

BibTeX - Entry

@InProceedings{knop_et_al:LIPIcs:2017:6988,
  author =	{Dusan Knop and Martin Kouteck{\'y} and Matthias Mnich},
  title =	{{Voting and Bribing in Single-Exponential Time}},
  booktitle =	{34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
  pages =	{46:1--46:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-028-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{66},
  editor =	{Heribert Vollmer and Brigitte Vallée},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/6988},
  URN =		{urn:nbn:de:0030-drops-69885},
  doi =		{10.4230/LIPIcs.STACS.2017.46},
  annote =	{Keywords: Parameterized algorithm, swap bribery, n-fold integer programming}
}

Keywords: Parameterized algorithm, swap bribery, n-fold integer programming
Collection: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Issue Date: 2017
Date of publication: 06.03.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI