Cloning in elections

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2010, Pages 768-773

  Elkind, Edith ^a   Faliszewski, Piotr ^b   Slinko, Arkadii ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

^c UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

MINIMUM COST; VOTING RULES;

CLONING;

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

References (14)

1. Bartholdi, III, J.; Tovey, C; and Trick, M. 1992. How hard is it to control an election? Mathematical and Computer Modeling 16(8-9):27-40.
2. Brandt, R, and Fischer, F. 2007. Computational aspects of covering in dominance graphs. In Proc. of AAAI-07.
3. Conitzer, V.; Rognlie, M.; and Xia, L. 2009. Preference functions that score rankings and maximum likelihood estimation. In Proc. of IJCAI-09.
4. Faliszewski, P.; Hemaspaandra, E.; Hemaspaandra, L.; and Rothe, J. 2009. Llull and Copeland voting computationally resist bribery and constructive control. JAIR 35:275-341.
5. Faliszewski, P.; Hemaspaandra, E.; and Hemaspaandra, L. 2009. Multimode attacks on elections. In Proc. of IJCAI-09.
6. Fishburn, P. 1977. Condorcet social choice functions. SIAM Journal on Applied Mathematics 33(3):469-489.
7. Laffond, G.; Laine, J.; and Laslier, J. 1996. Composition consistent tournament solutions and social choice functions. Social Choice and Welfare 13( 1 ):75-93. (Pubitemid 126818421)
8. Laslier, J.-F. 1997. Tournament Solutions and Majority Voting. Springer-Verlag.
9. Maudet, N.; Lang, J.; Chevaleyre, Y.; and Monnot, J. 2010. Possible winners when new candidates are added: The case of scoring rules. In Proc. of AAAl-10. To appear.
10. Miller, N. 1977. Graph theoretical approaches to the theory of voting. Am J Polit Sci 21(4):769-803.
11. Russel, N. 2007. Complexity of control of Borda count elections. Master's thesis, Rochester Institute of Technology.
12. Schulze, M. 2003. A new monotonic and clone-independent single-winner election method. Voting Matters 17:9-19.
13. Tideman, T. 1987. Independence of clones as a criterion for voting rules. Social Choice and Welfare 4(3): 185-206.
14. Zavist, T., and Tideman, T. 1989. Complete independence of clones in the ranked pairs rule. Social Choice and Welfare 64(2): 167-173.