Complexity of manipulating elections with few candidates
Eighteenth national conference on Artificial intelligence
Universal voting protocol tweaks to make manipulation hard
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Junta distributions and the average-case complexity of manipulating elections
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Journal of Computer and System Sciences
Algorithms for the coalitional manipulation problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Frequent Manipulability of Elections: The Case of Two Voters
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Improved bounds for computing Kemeny rankings
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Nonexistence of voting rules that are usually hard to manipulate
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The complexity of bribery in elections
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Llull and copeland voting broadly resist bribery and control
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Junta distributions and the average-case complexity of manipulating elections
Journal of Artificial Intelligence Research
Complexity of strategic behavior in multi-winner elections
Journal of Artificial Intelligence Research
Llull and Copeland voting computationally resist bribery and constructive control
Journal of Artificial Intelligence Research
How hard is bribery in elections?
Journal of Artificial Intelligence Research
Manipulation of copeland elections
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Hybrid voting protocols and hardness of manipulation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Voting in cooperative information agent scenarios: use and abuse
CIA'06 Proceedings of the 10th international conference on Cooperative Information Agents
The distortion of cardinal preferences in voting
CIA'06 Proceedings of the 10th international conference on Cooperative Information Agents
Hi-index | 0.00 |
We demonstrate how to make voting protocols resistant against manipulation by computationally bounded malicious voters, by extending the previous results of Conitzer and Sandholm in several important directions: we use one-way functions to close a security loophole that allowed voting officials to exert disproportionate influence on the outcome and show that our hardness results hold against a large fraction of manipulating voters (rather than a single voter). These improvements address important concerns in the field of secure voting systems. We also discuss the limitations of the current approach, showing that it cannot be used to achieve certain very desirable hardness criteria.