Solving Election Manipulation Using Integer Partitioning Problems (original) (raw)
Related papers
The computational difficulty of manipulating an election
Social Choice and Welfare, 1989
On the complexity of manipulating elections
… of the thirteenth Australasian symposium on …, 2007
Ties matter: Complexity of voting manipulation revisited
2011
On the complexity of voting manipulation under randomized tie-breaking
2011
A new measure of the difficulty of manipulation of voting rules
2010
The Complexity of the Possible Winner Problem over Partitioned Preferences
2019
Distance restricted manipulation in voting
Theoretical Computer Science
Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination
2007
Possible Winners when New Candidates Are Added: The Case of Scoring Rules
National Conference on Artificial Intelligence, 2010
Analysing Irresolute Multiwinner Voting Rules with Approval Ballots via SAT Solving
2020
The Complexity of Multiwinner Voting Rules with Variable Number of Winners
arXiv (Cornell University), 2017
On Coalitional Manipulation for Multiwinner Elections: Shortlisting
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Approximability of manipulating elections
2008
Manipulative elicitation – A new attack on elections with incomplete preferences
Theoretical Computer Science
Algorithmic Techniques for Necessary and Possible Winners
Vishal Chakraborty, Theo Delemazure, Kunal Relia
Kernelization complexity of possible winner and coalitional manipulation problems in voting
Theoretical Computer Science, 2016
Strategic Manipulation in Voting Systems
Multiwinner Approval Voting: An Apportionment Approach
SSRN Electronic Journal, 2000
Heuristics in Multi-Winner Approval Voting
arXiv (Cornell University), 2019
Multi-winner scoring election methods: Condorcet consistency and paradoxes
Public Choice, 2016
Complexity of manipulation with partial information in voting
Theoretical Computer Science
Multiwinner Voting with Fairness Constraints
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018
Asymptotic vulnerability of positional voting rules to coalitional manipulation
Mathematical Social Sciences, 2017
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
False-Name Manipulations in Weighted Voting Games
Journal of Artificial Intelligence Research, 2011
Voting schemes based on candidate-orderings or discrete choices considered harmful
2004
Manipulation of voting schemes with restricted beliefs
Journal of Mathematical Economics, 2008
Divide and conquer: False-name manipulations in weighted voting games
2008
On the manipulability of approval voting and related scoring rules
Social Choice and Welfare, 2011
2019
Manipulation of Voting Schemes: A General Result
Econometrica, 1973
Properties of Multiwinner Voting Rules
arXiv (Cornell University), 2015
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
Attainable results in committee elections
Mathematical and Computer Modelling, 1999