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...
| Publicado en: | Communications of the ACM Vol. 53; no. 11; pp. 74 - 83 |
|---|---|
| Autores principales: | , , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Nov2010
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=55063021&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 55063021 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Nov2010 vid: 53 iid: 11 pid: 68 pub: Association for Computing Machinery artinfo: ui: 55063021 10.1145/1839676.1839696 ppf: 74 ppct: 9 formats: tig: atl: Using Complexity to Protect Elections. aug: au: FALISZEWSKI, PIOTR HEMASPAANDRA, EDITH HEMASPAANDRA, LANE A. affil: Assistant professor, AGH University of Science and Technology, Kraków, Poland. Professor, Rochester Institute of Technology, Rochester, NY. Professor, University of Rochester, Rochester, NY. su: Computational complexity Corrupt practices in elections Voter turnout Algorithm research Bribery Voting research sug: subj: Computational complexity Corrupt practices in elections Voter turnout Algorithm research Bribery Voting research ab: 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. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2010 holdings: @attributes: islocal: N |
|---|