A dynamic rationalization of distance rationalizability

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2012, Pages 1278-1284

  Boutilier, Craig ^a   Procaccia, Ariel D ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION-THEORETIC; DISTANCE FUNCTIONS; DISTANCE MEASURE; DYNAMIC PROCESS; MARKOV DECISION PROCESSES; OPTIMAL POLICIES; SOCIAL CHOICE; SOCIAL DESIRABILITY; VOTING RULES;

DYNAMICS; MARKOV PROCESSES;

ARTIFICIAL INTELLIGENCE;

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

References (10)

1. Caragiannis, I.; Covey, J. A.; Feldman, M.; Homan, C. M.; Kaklamanis, C.; Karanikolas, N.; Procaccia, A. D.; and Rosenschein, J. S. 2009. On the approximability of Dodgson and Young elections. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1058-1067.
2. Elkind, E.; Faliszewski, P.; and Slinko, A. 2009. On distance rationalizability of some voting rules. In Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), 108-117.
3. Elkind, E.; Faliszewski, P.; and Slinko, A. 2010a. Good rationalizations of voting rules. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), 774-779.
4. Elkind, E.; Faliszewski, P.; and Slinko, A. 2010b. On the role of distances in defining voting rules. In Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 375-382.
5. Kenyon-Mathieu, C., and Schudy, W. 2007. How to rank with few errors. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 95-103.
6. Meskanen, T., and Nurmi, H. 2008. Closeness counts in social choice. In Braham, M., and Steffen, F., eds., Power, Freedom, and Voting. Springer-Verlag.
7. Nurmi, H. 2004. A comparison of some distance-based choice rules in ranking environments. Theory and Decision 57(1):5-24.
8. Parkes, D. C., and Procaccia, A. D. 2010. Dynamic social choice: Foundations and algorithms. Manuscript. Available from: http://people.seas. harvard.edu/~arielpro/papers/dynamic.pdf.
9. Procaccia, A. D. 2010. Can approximation circumvent Gibbard- Satterthwaite? In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), 836-841.
10. Puterman, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York: Wiley.