Sciweavers

Share
ALDT
2015
Springer

Elections with Few Candidates: Prices, Weights, and Covering Problems

4 years 10 months ago
Elections with Few Candidates: Prices, Weights, and Covering Problems
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.
Robert Bredereck, Piotr Faliszewski, Rolf Niederme
Added 15 Apr 2016
Updated 15 Apr 2016
Type Journal
Year 2015
Where ALDT
Authors Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon
Comments (0)
books