Winner determination in sequential majority voting

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1372-1377

  Lang, J ^a   Pini, M S ^b   Rossi, F ^b   Venable, K B ^b   Walsh, T ^c  

^a IRIT   (France)

^b UNIVERSITY OF PADOVA   (Italy)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCED TREES; COMPLETE INFORMATION; VOTING RULES; WINNER DETERMINATION;

ARTIFICIAL INTELLIGENCE;

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

References (12)

1. J. S. Banks. Sophisticated voting outcomes and agenda control. Social Choice and Welfare, 1(4):295-306, 1995.
2. J. Bartholdi III, C. Tovey, and M. Trick. How hard is it to control an election? Mathematical and Computer Modeling, 16(8/9): 27-40, 1992.
3. C. Boutilier, R. I. Brafman, C. Domshlak, H. Hoos, and D. Poole. Preference-based constrained optimization with CP-nets. Computational Intelligence, 20(2):137-157, 2004.
4. V. Conitzer and T. Sandholm. Complexity of manipulating elections with few candidates. In Proc. of AAAI- 02, pages 314-319, 2002.
5. V. Conitzer and T. Sandholm. Vote elicitation: complexity and strategy-proofness. In Proc. of AAAI- 02, pages 392-397, 2002.
6. V. Conitzer and T. Sandholm. Universal voting protocols tweaks to make manipulation hard. In Proc. of IJCAI-03, pages 781-788, 2003.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
8. K. Konczak and J. Lang. Voting procedures with incomplete preferences. In Proc. IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling, 2005.
9. J.-F. Laslier. Tournament solutions and majority voting . Springer, 1997.
10. N. Miller. A new solution set for tournaments and majority voting: further graph-theoretical approaches to the theory of voting. American Journal of Political Science, 24:68-9, 1980.
11. H. Moulin. Axioms of Cooperative Decision Making . Cambridge University Press, 1988.
12. C. Papadimitriou and M. Yannakakis. The complexity of restricted spanning tree problems. Journal of the ACM, 29(2):285-309, 1982.