Using complexity to protect elections
Open Access
- 1 November 2010
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 53 (11) , 74-82
Abstract
Computational complexity may truly be the shield against election manipulation.Keywords
Funding Information
- Polish Ministry of Science and Higher Education (N-N206-378637)
- Division of Computing and Communication Foundations (IIS-0713061CCF-0426761CCF-0915792)
- Division of Information and Intelligent Systems (IIS-0713061CCF-0426761CCF-0915792)
- AGH-UST (11.11.120.865)
This publication has 36 references indexed in Scilit:
- Generalized juntas and NP-hard setsTheoretical Computer Science, 2009
- Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive ControlMathematical Logic Quarterly, 2009
- Algorithms for the coalitional manipulation problemArtificial Intelligence, 2009
- On complexity of lobbying in multiple referendaReview of Economic Design, 2007
- When are elections with few candidates hard to manipulate?Journal of the ACM, 2007
- Anyone but him: The complexity of precluding an alternativeArtificial Intelligence, 2007
- Dichotomy for voting systemsJournal of Computer and System Sciences, 2007
- Exact analysis of Dodgson electionsJournal of the ACM, 1997
- Strong self-reducibility precludes strong immunityTheory of Computing Systems, 1996
- Complete sets and closeness to complexity classesTheory of Computing Systems, 1986