View in EDS PDF Full Text

Using Complexity to Protect Elections.

Saved in:
Bibliographic Details
Title: Using Complexity to Protect Elections.
Authors: FALISZEWSKI, PIOTR1 faliszew@agh.edu.pl, HEMASPAANDRA, EDITH2 eh@cs.rit.edu, HEMASPAANDRA, LANE A.3 lane@cs.rochester.edu
Source: Communications of the ACM. Nov2010, Vol. 53 Issue 11, p74-82. 9p. 1 Color Photograph, 1 Illustration, 2 Diagrams, 1 Chart, 1 Graph.
Subjects: Computational complexity, Corrupt practices in elections, Voter turnout, Algorithm research, Bribery, Voting research
Abstract: The article discusses the potential for computational complexity to be used as a shield for protecting election results from the influence of electronic agents. As elections have become conducted via electronic media, outside agents have begun trying to change the structure of elections by suppressing turnout, setting election district boundaries, or casting insincere votes. Using a network of algorithms and dichotomy theorems, computer scientists are attempting to understand the mechanisms underlying three types of manipulation in elections: structural control attacks, voter manipulation, and bribery.
Database: Engineering Source
Description
Abstract:The article discusses the potential for computational complexity to be used as a shield for protecting election results from the influence of electronic agents. As elections have become conducted via electronic media, outside agents have begun trying to change the structure of elections by suppressing turnout, setting election district boundaries, or casting insincere votes. Using a network of algorithms and dichotomy theorems, computer scientists are attempting to understand the mechanisms underlying three types of manipulation in elections: structural control attacks, voter manipulation, and bribery.
ISSN:00010782
DOI:10.1145/1839676.1839696