@inproceedings{23abe58979524c4fb4bab8d9ea82ec11,
title = "Elections with few candidates: Prices, weights, and covering problems",
abstract = "We show that a number of election-related problems with prices (such as, for example, bribery) are fixed-parameter tractable (in FPT) when parameterized by the number of candidates. For bribery, this resolves a nearly 10-year old family of open problems. Our results follow by a general technique that formulates voting problems as covering problems and extends the classic approach of using integer linear programming and the algorithm of Lenstra [19]. In this context, our central result is that Weighted Set Multicover parameterized by the universe size is fixed-parameter tractable. Our approach is also applicable to weighted electoral control for Approval voting. We improve previously known XP-memberships to FPT-memberships. Our preliminary experiments on real-world-based data show the practical usefulness of our approach for instances with few candidates.",
author = "Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier and Piotr Skowron and Nimrod Talmon",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 4th International Conference on Algorithmic Decision Theory, ADT 2015 ; Conference date: 27-09-2015 Through 30-09-2015",
year = "2015",
month = jan,
day = "1",
doi = "10.1007/978-3-319-23114-3\_25",
language = "American English",
isbn = "9783319231136",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "414--431",
editor = "Toby Walsh",
booktitle = "Algorithmic Decision Theory - 4th International Conference, ADT 2015, Proceedings",
address = "Germany",
}
