On the role of distances in defining voting rules

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

Volumn 1, Issue , 2010, Pages 375-382

  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

Complexity; Distance rationalizability; Elections; Voting

Indexed keywords

AUTONOMOUS AGENTS; MAXIMUM LIKELIHOOD ESTIMATION;

COMPLEXITY; DISTANCE FUNCTIONS; DISTANCE RATIONALIZABILITY; ELECTIONS; SCORING RULES; VOTING; VOTING RULES; WINNER DETERMINATION PROBLEM;

MULTI AGENT SYSTEMS;

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

References (24)

1. N. Baigent. Metric rationalisation of social choice functions according to principles of social choice. Mathematical Social Sciences, 13(1):59-65. 1987.
2. N. Betzler, J. Guo, and R. Niedermeier. Parameterized computational complexity of Dodgson and Young elections. In Proceedings of SWAT-08, pages 402-413, July 2008.
3. N. Betzler, S. Hemmann, and R. Niedermeier. A multivariate complexity analysis of determining possible winners given incomplete votes. In Proceedings of IJCAI-09, July 2009.
4. I. Caragiannis, J. Covey, M. Feldman, C. Homan. C. Kaklamanis, N. Karanikolas, A. Procaccia. and J. Rosenschein. On the approximability of Dodgson and Young elections. In Proceedings of SODA-09, pages 1058-1067, Jan. 2009.
5. V. Conitzer, M. Rognlie, and L. Xia. Preference functions that score rankings and maximum likelihood estimation. In Proceedings of UCAI-09, July 2009.
6. V. Conitzer and T. Sandholm. Common voting rules as maximum likelihood estimators. In Proceedings of UAI-05, pages 145-152, July 2005.
7. V. Conitzer, T. Sandholm, and J. Lang. When are elections with few candidates hard to manipulate? Journal of the ACM, 54(3): Article 14, 2007.
8. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In Proceedings of WWW-01, pages 613-622, Mar. 2001.
9. E. Elkind, P. Faliszewski, and A. Slinko. On distance rationalizability of some voting rules. In Proceedings of TARK-09, pages 108-117, July 2009.
10. E. Ephrati and J. Rosenschein. A heuristic technique for multi-agent planning. Annals of Mathematics and Artificial Intelligence, 20(1-4): 13-67, 1997.
11. P. Faliszewski, E. Hemaspaandra, and L. Hemaspaandra. How hard is bribery in elections? JAIR, 35:485-532, 2009.
12. P. Faliszewski, E. Hemaspaandra. L. Hemaspaandra, and J. Rothe. Llull and Copeland voting computationally resist bribery and constructive control. JAIR, 35:275-341, 2009.
13. S. Ghosh, M. Mundhe, K. Hernandez, and S. Sen. Voting for movies: The anatomy of recommender systems. In Proceedings of Agents-99, pages 434-435, 1999.
14. E. Hemaspaandra, L. Hemaspaandra. and J. Rothe. Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. Journal of the ACM, 44(6):806-825, 1997.
15. E. Hemaspaandra, H. Spakowski, and J. Vogel. The complexity of Kcmcny elections. Theor. Comp. Sci., 349(3):382-391, 2005.
16. L. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. Springer-Verlag, 2002.
17. R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of STOC-80, pages 302-309, Apr. 1980.
18. K. Konczak and J. Lang. Voting procedures with incomplete preferences. In IJCAI-05 Workshop on Advances in Preference Handling, pages 124-129, 2005.
19. H. Lenstra, Jr. Integer programming with a fixed number of variables. Math, of Op. Res., 8(4):538-548, 1983.
20. R. Meir, A. Procaccia, J. Rosenschein, and A. Zohar. The complexity of strategic behavior in multi-winner elections. JAIR, 33:149-178, 2008.
21. T. Meskanen and H. Nurmi. Closeness counts in social choice. In M. Braham and F. Steffen, editors, Power, freedom, and Voting. 2008.
22. H. Moulin. Axioms of Cooperative Decision Making. Cambridge University Press, 1991.
23. L. Xia and V. Conitzer. Determining possible and necessary winners under common voting rules given partial orders. In Proceedings of AAAI-08, pages 196-201, July 2008.
24. H. Young. Social choice scoring functions. SI AM Journal on Applied Mathematics, 28(4):824-838, 1975.