Evaluation of election outcomes under uncertainty

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 2, Issue , 2008, Pages 941-948

  Hazon, Noam ^a   Aumann, Yonatan ^a   Kraus, Sarit ^a   Wooldridge, Michael ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Computational social choice; Voting protocols

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS; PROBABILITY DISTRIBUTIONS;

COMPUTATIONAL SOCIAL CHOICES; IMPERFECT INFORMATION; NP COMPLETE; PLURALITY VOTING; POLYNOMIAL ALGORITHM; VOTING PROTOCOLS;

PROBLEM SOLVING;

EID: 84899977725     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. K. J. Arrow, A. K. Sen, and K. Suzumura, editors. Handbook of Social Choice and Welfare Volume 1. Elsevier Science Publishers B.V.: Amsterdam, The Netherlands, 2002.
2. J. J. Bartholdi and J. Orlin. Single transferable vote resists strategic voting. Social Choice and Welfare, 8:341-354, 1991.
3. J. J. Bartholdi, C. A. Tovey, and M. A. Trick. The computational difficulty of manipulating an election. Social Choice and Welfare, 6:227-241, 1989.
4. J. J. Bartholdi, C. A. Tovey, and M. A. Trick. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6:157-165, 1989.
5. V. Conitzer and T. Sandholm. Complexity of manipulating elections with few candidates. Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002), 2002.
6. V. Conitzer and T. Sandholm. Universal voting protocol tweaks to make manipulation hard. Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), 2003.
7. V. Conitzer, T. Sandholm, and J. Lang. When are elections with few candidates hard to manipulate? Journal of the ACM, 54(3):l-33, June 2007.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman: New York, 1979.
9. D. B. West, editor. Introduction to Graph Theory. Prentice Hall, 2 edition, 2001.