Cited By
View all- Harley KCooper R(2021)Information IntegrityACM Computing Surveys10.1145/343681754:2(1-35)Online publication date: 9-Feb-2021
Inside risks
U.S. election after-math
Abstract
Recounting problems still associated with election integrity, transparency, and accountability.
References
[1]
Bishop, M. and Wagner, D. Risks of e-voting. Commun. ACM 50, 11 (Nov. 2007); http://www.sos.ca.gov/elections/elections_vsr.htm.
[2]
E-Deceptive Campaign Practices, EPIC and the Century Found. (Oct. 20, 2008), http://votingintegrity.org/pdf/edeceptive_report.pdf; and Deceptive Practices 2.0: Legal and Policy Responses Common Cause, The Lawyers Committee for Civil Rights under Law, and the Century Found. (Oct. 20, 2008), http://www.tcf.org/list.asp?type=TP&topic=6.
Index Terms
- Inside risks
U.S. election after-math
Recommendations
Election with bribed voter uncertainty: hardness and approximation algorithm
AAAI'19/IAAI'19/EAAI'19: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial IntelligenceBribery in election (or computational social choice in general) is an important problem that has received a considerable amount of attention. In the classic bribery problem, the briber (or attacker) bribes some voters in attempting to make the briber's ...
Election Verifiability for Helios under Weaker Trust Assumptions
Computer Security - ESORICS 2014AbstractMost electronic voting schemes aim at providing verifiability: voters should trust the result without having to rely on some authorities. Actually, even a prominent voting system like Helios cannot fully achieve verifiability since a dishonest ...
Election with bribe-effect uncertainty: a dichotomy result
IJCAI'19: Proceedings of the 28th International Joint Conference on Artificial IntelligenceWe consider the electoral bribery problem in computational social choice. In this context, extensive studies have been carried out to analyze the computational vulnerability of various voting (or election) rules. However, essentially all prior studies ...
Comments
Information & Contributors
Information
Published In
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 February 2009
Published in CACM Volume 52, Issue 2
Check for updates
Qualifiers
- Department
- Popular
- Un-reviewed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 721Total Downloads
- Downloads (Last 12 months)217
- Downloads (Last 6 weeks)66
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
Cited By
View all- Harley KCooper R(2021)Information IntegrityACM Computing Surveys10.1145/343681754:2(1-35)Online publication date: 9-Feb-2021
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderDigital Edition
View this article in digital edition.
Digital EditionMagazine Site
View this article on the magazine site (external)
Magazine SiteLogin options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in