Efficient vote elicitation under candidate uncertainty

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 309-316

  Oren, Joel ^a   Filmus, Yuval ^a   Boutilier, Craig ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH PROBABILITY; MINIMAL VALUE; PROBABILISTIC MODELS; VOTING RULES;

ARTIFICIAL INTELLIGENCE;

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

References (24)

1. Katherine A. Baldiga and Jerry R. Green. Assent-maximizing social choice. Social Choice and Welfare, pages 1-22, 2011. Online First.
2. John Bartholdi III, Craig Tovey, and Michael Trick. How hard is it to control an election? Social Choice and Welfare, 16(8-9):27-40, 1992.
3. Craig Boutilier, Jérôme Lang, Joel Oren, and Héctor Palacios. Robust winners and winner determination policies under candidate uncertainty. In Proceedings of the Fourth International Workshop on Computational Social Choice (COMSOC-2012), Kraków, Poland, 2012.
4. Ludwig M. Busse, Peter Orbanz, and Joachim M. Buhmann. Cluster analysis of heterogeneous rank data. In Proceedings of the Twenty-fourth International Conference on Machine Learning (ICML-07), pages 113-120, 2007.
5. Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, and Jérôme Monnot. Possible winners when new candidates are added: The case of scoring rules. In Proceedings of the Twenty-fourth AAAI Conference on Artificial Intelligence (AAAI-10), pages 762-767, Atlanta, GA, 2010.
6. marquis de (Marie Jean Antoine Nicolas de Caritat) Condorcet. Essai sur l'Application de l'Analyse a la Probabilite des Decisions rendues a la Probabilite des Voix. Paris: L'Imprimerie Royale, 1785.
7. Vincent Conitzer and Tuomas Sandholm. Communication complexity of common voting rules. In Proceedings of the Sixth ACM Conference on Electronic Commerce (EC'05), pages 78-87, Vancouver, 2005.
8. Vincent Conitzer. Eliciting single-peaked preferences using comparison queries. Journal of Artificial Intelligence Research, 35:161-191, 2009.
9. Ning Ding and Fangzhen Lin. Voting with partial information: Minimal sets of questions to decide an outcome. In Proceedings of the Fourth International Workshop on Computational Social Choice (COMSOC-2012), Kraków, Poland, 2012.
10. Edith Hemaspaandra, Lane Hemaspaandra, and Jörg Rothe. Anyone but him: The complexity of precluding an alternative. Artificial Intelligence, 171(5-6):255-285, 2007.
11. Meir Kalech, Sarit Kraus, Gal A. Kaminka, and Claudia V. Goldman. Practical voting rules with partial information. Journal of Autonomous Agents and Multi-Agent Systems, 22(1):151-182, 2011.
12. Kathrin Konczak and Jérôme Lang. Voting procedures with incomplete preferences. In IJCAI-05 Workshop on Advances in Preference Handling, pages 124-129, Edinburgh, 2005.
13. V. Yu. Korolev and I. G. Shevtsova. On the upper bound for the absolute constant in the berry-esseen inequality. Theory of Probability and its Applications, 54(4):638-658, 2010.
14. Tyler Lu and Craig Boutilier. The unavailable candidate model: A decision-theoretic view of social choice. In Proceedings of the Eleventh ACM Conference on Electronic Commerce (EC'10), pages 263-274, Cambridge, MA, 2010.
15. Tyler Lu and Craig Boutilier. Learning Mallows models with pairwise preferences. In Proceedings of the Twenty-eighth International Conference on Machine Learning (ICML-11), pages 145-152, Bellevue, WA, 2011.
16. Tyler Lu and Craig Boutilier. Robust approximation and incremental elicitation in voting protocols. In Proceedings of the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI- 11), pages 287-293, Barcelona, 2011.
17. Tyler Lu and Craig Boutilier. Vote elicitation with probabilistic preference models: Empirical estimation and cost tradeoffs. In Proceedings of the Second International Conference on Algorithmic Decision Theory (ADT-11), pages 135-149, Piscataway, NJ, 2011.
18. Colin L. Mallows. Non-null ranking models. Biometrika, 44:114-130, 1957.
19. John I. Marden. Analyzing and Modeling Rank Data. Chapman and Hall, London, 1995.
20. Thomas Brendan Murphy and Donal Martin. Mixtures of distance-based models for ranking data. Computational Statistics and Data Analysis, 41:645-655, January 2003.
21. Martin Raab and Angelika Steger. "balls into bins" - a simple and tight analysis. In Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM '98, pages 159-170, London, UK, UK, 1998. Springer-Verlag.
22. Michel Regenwetter, Bernard Grofman, A. A. J. Marley, and Ilia Tsetlin. Behavioral Social Choice: Probabilistic Models, Statistical Inference, and Applications. Cambridge University Press, Cambridge, 2006.
23. Lirong Xia and Vincent Conitzer. Determining possible and necessary winners under common voting rules given partial orders. In Proceedings of the Twenty-third AAAI Conference on Artificial Intelligence (AAAI-08), pages 202-207, Chicago, 2008.
24. Peyton Young. Optimal voting rules. Journal of Economic Perspectives, 9:51-64, 1995.