Living Reference Work Entry

Encyclopedia of Algorithms

pp 1-5

Date: Latest Version

Parameterization in Computational Social Choice

  • Piotr  FaliszewskiAffiliated withAGH University of Science and Technology Email author 
  • , Rolf  NiedermeierAffiliated withInstitut für Softwaretechnik und Theoretische Informatik, TU Berlin

Keywords

NP-hard problems Parameterized and multivariate complexity analysis Voting problems Winner determination Bribery in elections Control in elections

Years and Authors of Summarized Original Work

  • 1989; Bartholdi, Tovey, Trick

  • 2009; Betzler, Uhlmann

  • 2012; Dorn, Schlotter

  • 2011; Liu, Feng, Zhu, Luan

Problem Definition

Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side and Mathematics and Computer Science (including artificial intelligence and multi-agent systems) on the other side. Concrete questions addressed in this area include the following three: How efficiently can one determine the winner of an election, given a number of votes with preferences over a number of alternatives? Is it possible to obtain a desirable outcome of an election by executing a number of campaigning actions? (Formally, such problems are often modeled as bribery.) Can the chair of an election influence the result of an election by modifying the set of available alternatives (e.g., by encouraging some alternatives (candidates) to participate in the run)?

The main objective of pa ...

This is an excerpt from the content