Elections with few candidates: Prices, weights, and covering problems

Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

26 Scopus citations


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.

Original languageEnglish
Title of host publicationAlgorithmic Decision Theory - 4th International Conference, ADT 2015, Proceedings
EditorsToby Walsh
PublisherSpringer Verlag
Number of pages18
ISBN (Print)9783319231136
StatePublished - 1 Jan 2015
Externally publishedYes
Event4th International Conference on Algorithmic Decision Theory, ADT 2015 - Lexington, United States
Duration: 27 Sep 201530 Sep 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Conference on Algorithmic Decision Theory, ADT 2015
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Elections with few candidates: Prices, weights, and covering problems'. Together they form a unique fingerprint.

Cite this