Llull and Copeland voting broadly resist bribery and control

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 724-730

  Faliszewski, Piotr ^a   Hemaspaandra, Edith ^b   Hemaspaandra, Lane A ^a   Rothe, Jörg ^c  

^a University of Rochester   (United States)

^b Rochester Institute of Technology   (United States)

^c HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; INTELLIGENT AGENTS;

BRIBERY ATTACKS; ELECTION SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 36348990177     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Bartholdi, III, J., and Orlin, J, 1991. Single transferable vote resists strategic voting. Social Choice and Welfare 8(4):341-354.
2. Bartholdi, III, J.; Tovey, C.; and Trick, M. 1989. The computational difficulty of manipulating an election. Social Choice and Welfare 6(3):227-241.
3. Bartholdi, III, J.; Tovey, G.; and Trick, M. 1992. How hard is it to control an election? Mathematical and Computer Modeling 16(8/9):27-40.
4. Conitzer, V., and Sandholm, T. 2002a. Complexity of manipulating elections with few candidates. In Proc. of AAAI-02, 314-319. AAAI Press.
5. Conitzer, V., and Sandholm, T. 2002b. Vote elicitation: Complexity and strategy-proofness. In Proc. of AAAI-02, 392-397. AAAI Press.
6. Conitzer, V., and Sandholm, T. 2003. Universal voting protocol tweaks to make manipulation hard. In Proc. of IJCAI-03, 781-788. Morgan Kaufmann.
7. Conitzer, V., and Sandholm, T. 2006. Nonexistence of voting rules that are usually hard to manipulate. In AAAI-06. AAAI Press.
8. Conitzer, V.; Lang, J.; and Sandholm, T. 2003. How many candidates are needed to make elections hard to manipulate? In Proc. of the 9th Conf. on Theoretical Aspects of Rationality and knowledge, 201-214. ACM Press.
9. Dwork, C.; Kumar, R.; Naor, M.; and Sivakumar, D. 2001. Rank aggregation methods for the web. In Proc. of the 10th Intl. World Wide Web Conf, 613-622. ACM Press.
10. Elkind, E., and Lipmaa, H. 2005. Small coalitions cannot manipulate voting. In Proc. of the 9th Intl. Conf. on Financial Cryptography and Data Security, 285-297. Springer-Verlag Lecture Notes in Computer Science #3570.
11. Ephrati, E., and Rosenschein, J. 1993. Multi-agent planning as a dynamic search for social consensus. In Proc. of UCAI-93,423-429. Morgan Kaufmann.
12. Erdélyi, G.; Hemaspaandra, L.; Rothe, J.; and Spakowski, H. 2007. On approximating optimal weighted lobbying, and frequency of correctness versus average-case polynomial time. Technical Report TR-914, Department of Computer Science, University of Rochester, Rochester, NY. Faliszewski, P.; Hemaspaandra, E.; and Hemaspaandra, L. 2006. The complexity of bribery in elections. In AAAI-06, 641-646. AAAI Press.
13. Hagele, G., and Pukelsheim, F. 2001. The electoral writings of Ramon Llull. Studia Lulliana 41(97):3-38.
14. Hemaspaandra, E., and Hemaspaandra, L. 2007. Dichotomy for voting systems. Journal of Computer and System Sciences 73(1):73-83.
15. Hemaspaandra, E.; Hemaspaandra, L.; and Rothe, J. 2007a. Anyone but him: The complexity of precluding an alternative. Artificial Intelligence 171 (5-6):255-285.
16. Hemaspaandra, E.; Hemaspaandra, L.; and Rothe, J. 2007b. Hybrid elections broaden complexity-theoretic resistance to control. In Proc. of IJCAI-07, 1308-1314. AAAI Press.
17. Homan, C., and Hemaspaandra, L. 2006. Guarantees for the success frequency of an algorithm for finding Dodgsonelection winners. In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, 528-539. Springer-Verlag Lecture Notes in Computer Science #4162.
18. Procaccia, A., and Rosenschein, J. 2006. Junta distributions and the average-case complexity of manipulating elections. In Proc. of the 5th Int. Joint Conf on Autonom. Agents and Multiagent Systems, 497-504. ACM Press.
19. Procaccia, A.; Rosenschein, J.; and Kaminka, G. 2007. On the robustness of preference aggregation in noisy environments. In Proc. of the 6th Int. Joint Conf. on Autonom. Agents and Multiagent Systems. ACM Press. To appear, 2007.
20. Procaccia, A.; Rosenschein, J.; and Zohar, A. 2007. Multiwinner elections: Complexity of manipulation, control, and winner-determination. In Proc. of IJCAI-07, 1476-1481. AAAI Press.