When are elections with few candidates hard to manipulate?
Journal of the ACM (JACM)
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
Generalized scoring rules and the frequency of coalitional manipulability
Proceedings of the 9th ACM conference on Electronic commerce
Elections Can be Manipulated Often
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Algorithms for the coalitional manipulation problem
Artificial Intelligence
Multimode control attacks on elections
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Complexity of unweighted coalitional manipulation under some common voting rules
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
Information Processing Letters
An NTU cooperative game theoretic view of manipulating elections
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
We introduce a new algorithm for the Unweighted Coalitional Manipulation problem under the Maximin voting rule. We prove that the algorithm gives an approximation ratio of 1 2/3 to the corresponding optimization problem. This is an improvement over the previously known algorithm that gave a 2-approximation. We also prove that its approximation ratio is no better than 1 1/2, i.e., there are instances on which a 1 1/2-approximation is the best the algorithm can achieve. Finally, we prove that no algorithm can approximate the problem better than to the factor of 1 1/2, unless p = NP.