Vote elicitation with probabilistic preference models: Empirical estimation and cost tradeoffs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6992 LNAI, Issue , 2011, Pages 135-149

  Lu, Tyler ^a   Boutilier, Craig ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

preference elicitation; probabilistic rankings; social choice; voting

Indexed keywords

AMOUNT OF INFORMATION; COST TRADE-OFF; DISTRIBUTIONAL MODELS; GROUP DECISION MAKING; HIGH PROBABILITY; HIGH QUALITY; PREFERENCE AGGREGATIONS; PREFERENCE ELICITATION; PREFERENCE INFORMATION; PREFERENCE MODELS; PROBABILISTIC ANALYSIS; PROBABILISTIC RANKINGS; PROBABLY APPROXIMATELY CORRECT; RANKING OF ALTERNATIVES; SAMPLE COMPLEXITY; SOCIAL CHOICE; VOTING; VOTING RULES;

ALGORITHMS; DECISION MAKING;

DECISION THEORY;

EID: 80054918918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24873-3_11     Document Type: Conference Paper

References (16)

1. Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: A short introduction to computational social choice. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 51-69. Springer, Heidelberg (2007)
2. Conitzer, V., Sandholm, T.: Vote elicitation: Complexity and strategy-proofness. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI 2002), Edmonton, pp. 392-397 (2002)
3. Conitzer, V., Sandholm, T.: Communication complexity of common voting rules. In: Proceedings of the Sixth ACM Conference on Electronic Commerce (EC 2005), Vancouver, pp. 78-87 (2005)
4. Doignon, J.-P., Pekec, A., Regenwetter, M.: The repeated insertion model for rankings: Missing link between two subset choice models. Psychometrika 69(1), 33-54 (2004)
5. Gaertner, W.: A Primer in Social Choice Theory. LSE Perspectives in Economic Analysis. Oxford University Press, USA (August 2006)
6. Kalech, M., Kraus, S., Kaminka, G.A., Goldman, C.V.: Practical voting rules with partial information. Journal of Autonomous Agents and Multi-Agent Systems 22(1), 151-182 (2011)
7. Kamishima, T., Kazawa, H., Akaho, S.: Supervised ordering: An empirical survey. In: IEEE International Conference on Data Mining, pp. 673-676 (2005)
8. Lang, J.: Vote and aggregation in combinatorial domains with structured preferences. In: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), Hyderabad, India, pp. 1366-1371 (2007)
9. Lu, T., Boutilier, C.: Learning Mallows models with pairwise preferences. In: Proceedings of the Twenty-eighth International Conference on Machine Learning (ICML 2011), Bellevue, Washington (2011)
10. Lu, T., Boutilier, C.: Robust approximation and incremental elicitation in voting protocols. In: Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona (to appear, 2011)
11. Mallows, C.L.: Non-null ranking models. Biometrika 44, 114-130 (1957)
12. Marden, J.I.: Analyzing and modeling rank data. Chapman and Hall, Boca Raton (1995)
13. Murphy, T.B., Martin, D.: Mixtures of distance-based models for ranking data. Computational Statistics and Data Analysis 41, 645-655 (2003)
14. Regenwetter, M., Grofman, B., Marley, A.A.J., Tsetlin, I.: Behavioral Social Choice: Probabilistic Models, Statistical Inference, and Applications. Cambridge University Press, Cambridge (2006)
15. Valiant, L.G.: A theory of the learnable. Communications of the ACM 27(11), 1134-1142 (1984)
16. Xia, L., Conitzer, V.: Determining possible and necessary winners under common voting rules given partial orders. In: Proceedings of the Twenty-third AAAI Conference on Artificial Intelligence (AAAI 2008), Chicago, pp. 202-207 (2008)