The computational difficulty of manipulating an election (original) (raw)
Related papers
On the complexity of manipulating elections
… of the thirteenth Australasian symposium on …, 2007
Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination
2007
Ties matter: Complexity of voting manipulation revisited
2011
On the complexity of voting manipulation under randomized tie-breaking
2011
Complexity of manipulation with partial information in voting
Theoretical Computer Science
Protecting Election from Bribery: New Approach and Computational Complexity Characterization
2018
Computational Complexity Characterization of Protecting Elections from Bribery
2020
A new measure of the difficulty of manipulation of voting rules
2010
Manipulative elicitation – A new attack on elections with incomplete preferences
Theoretical Computer Science
Essays on the complexity of voting manipulation
Asymptotic Collusion-proofness of Voting Rules: The Case of Large Number of Candidates
Studies in Microeconomics
ArXiv, 2019
Average-case tractability of manipulation in voting via the fraction of manipulators
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems - AAMAS '07, 2007
Manipulability of Single Transferable Vote
2010
Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm
Proceedings of the AAAI Conference on Artificial Intelligence
Hardness and Algorithms for Electoral Manipulation Under Media Influence
How hard is it to control an election?
Mathematical and Computer Modelling, 1992
The Complexity of Multiwinner Voting Rules with Variable Number of Winners
arXiv (Cornell University), 2017
Approximability of Manipulating Elections
2008
Distance restricted manipulation in voting
Theoretical Computer Science
Protecting Elections by Recounting Ballots
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
Strategic Manipulation in Voting Systems
Nondictatorial social choice rules are safely manipulable
2008
Complexity of some aspects of control and manipulation in weighted voting games}
2009
Solving Election Manipulation Using Integer Partitioning Problems
International Foundation for Autonomous Agents and Multiagent Systems, 2011
Junta distributions and the average-case complexity of manipulating elections
Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems - AAMAS '06, 2006
The complexity of strategic behavior in multi-winner elections
2008
Coercion-resistant electronic elections
2005
Kernelization complexity of possible winner and coalitional manipulation problems in voting
Theoretical Computer Science, 2016
Anonymous voting and minimal manipulability
Journal of Economic Theory, 2007
On the complexity of achieving proportional representation
Social Choice and Welfare, 2008
Coalitional Voting Manipulation: A Game-Theoretic Perspective
2011
On complexity of lobbying in multiple referenda
Review of Economic Design, 2007
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters
Computational complexity of manipulation: A survey
Automation and Remote Control, 2016