Using Complexity to Protect Elections.

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 suppressi...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 53; no. 11; pp. 74 - 83
Autores principales: FALISZEWSKI, PIOTR, HEMASPAANDRA, EDITH, HEMASPAANDRA, LANE A.
Formato: Artículo
Publicado: Association for Computing Machinery Nov2010
Materias:
Acceso en línea:Ver este registro en EBSCOhost
Descripción
Sumario: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.