TY - GEN
T1 - Elections with few candidates
T2 - 4th International Conference on Algorithmic Decision Theory, ADT 2015
AU - Bredereck, Robert
AU - Faliszewski, Piotr
AU - Niedermeier, Rolf
AU - Skowron, Piotr
AU - Talmon, Nimrod
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84945894134&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-23114-3_25
DO - 10.1007/978-3-319-23114-3_25
M3 - Conference contribution
AN - SCOPUS:84945894134
SN - 9783319231136
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 414
EP - 431
BT - Algorithmic Decision Theory - 4th International Conference, ADT 2015, Proceedings
A2 - Walsh, Toby
PB - Springer Verlag
Y2 - 27 September 2015 through 30 September 2015
ER -
