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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 55063021
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Using Complexity to Protect Elections.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22FALISZEWSKI%2C+PIOTR%22">FALISZEWSKI, PIOTR</searchLink><relatesTo>1</relatesTo><i> faliszew@agh.edu.pl</i><br /><searchLink fieldCode="AR" term="%22HEMASPAANDRA%2C+EDITH%22">HEMASPAANDRA, EDITH</searchLink><relatesTo>2</relatesTo><i> eh@cs.rit.edu</i><br /><searchLink fieldCode="AR" term="%22HEMASPAANDRA%2C+LANE+A%2E%22">HEMASPAANDRA, LANE A.</searchLink><relatesTo>3</relatesTo><i> lane@cs.rochester.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Nov2010, Vol. 53 Issue 11, p74-82. 9p. 1 Color Photograph, 1 Illustration, 2 Diagrams, 1 Chart, 1 Graph.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Corrupt+practices+in+elections%22">Corrupt practices in elections</searchLink><br /><searchLink fieldCode="DE" term="%22Voter+turnout%22">Voter turnout</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithm+research%22">Algorithm research</searchLink><br /><searchLink fieldCode="DE" term="%22Bribery%22">Bribery</searchLink><br /><searchLink fieldCode="DE" term="%22Voting+research%22">Voting research</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=55063021
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/1839676.1839696
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 9
        StartPage: 74
    Subjects:
      – SubjectFull: Computational complexity
        Type: general
      – SubjectFull: Corrupt practices in elections
        Type: general
      – SubjectFull: Voter turnout
        Type: general
      – SubjectFull: Algorithm research
        Type: general
      – SubjectFull: Bribery
        Type: general
      – SubjectFull: Voting research
        Type: general
    Titles:
      – TitleFull: Using Complexity to Protect Elections.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: FALISZEWSKI, PIOTR
      – PersonEntity:
          Name:
            NameFull: HEMASPAANDRA, EDITH
      – PersonEntity:
          Name:
            NameFull: HEMASPAANDRA, LANE A.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2010
              Type: published
              Y: 2010
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 53
            – Type: issue
              Value: 11
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1