Winner determination in voting trees with incomplete preferences and weighted votes
- 228 Downloads
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider the use of voting tree rules to aggregate agents’ preferences. In a voting tree, decisions are taken by performing a sequence of pairwise comparisons in a binary tree where each comparison is a majority vote among the agents. Incompleteness in the agents’ preferences is common in many real-life settings due to privacy issues or an ongoing elicitation process. We study how to determine the winners when preferences may be incomplete, not only for voting tree rules (where the tree is assumed to be fixed), but also for the Schwartz rule (in which the winners are the candidates winning for at least one voting tree). In addition, we study how to determine the winners when only balanced trees are allowed. In each setting, we address the complexity of computing necessary (respectively, possible) winners, which are those candidates winning for all completions (respectively, at least one completion) of the incomplete profile. We show that many such winner determination problems are computationally intractable when the votes are weighted. However, in some cases, the exact complexity remains unknown. Since it is generally computationally difficult to find the exact set of winners for voting trees and the Schwartz rule, we propose several heuristics that find in polynomial time a superset of the possible winners and a subset of the necessary winners which are based on the completions of the (incomplete) majority graph built from the incomplete profiles.
KeywordsVoting trees Incompleteness Winner determination
Unable to display preview. Download preview PDF.
- 2.Baumeister, D., & Rothe, J. (2010). Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules. In Proceedings of ECAI’10 (pp. 1019–1020). Lisbon, Portugal.Google Scholar
- 3.Betzler, N., & Dorn, B. (2009). Towards a dichotomy of finding possible winners in elections based on Scoring rules. In Proceedings of MFCS’09, Lecture notes in computer science (Vol. 5734, pp. 124–136). Novy Smokovec, High Tatras, Slovakia.Google Scholar
- 5.Betzler, N., Hemmann, S., & Niedermeier, R. (2009). A multivariate complexity analysis of determining possible winners given incomplete votes. In Proceedings of IJCAI’09 (pp. 53–58). Pasadena, CA.Google Scholar
- 6.Brandt, F., Fischer, F., & Harrenstein, P. (2007). The computational complexity of choice sets. In Proceedings of TARK’07 (pp. 82–91). Brussels, Belgium.Google Scholar
- 8.Chevaleyre, Y., Lang, J., Maudet, N., & Monnot, J. (2010). Possible winners when new candidates are added: The case of scoring rules. In Proceedings of AAAI’10, Atlanta, GA.Google Scholar
- 9.Conitzer, V., & Sandholm, T. (2002). Complexity of manipulating an election with few candidates. In Proceedings of AAAI’02 (pp. 314–319). Edmonton, AB, Canada.Google Scholar
- 10.Conitzer, V., & Sandholm, T. (2002). Vote elicitation: Complexity and strategy-proofness. In Proceedings of AAAI’02 (pp. 392–397). Edmonton, AB, Canada.Google Scholar
- 12.Copeland, A. H. (1951). A reasonable social welfare function. University of Michigan Seminar on Applications of Mathematics to the Social Sciences.Google Scholar
- 13.Cormen T. H., Leiserson C. E., Rivest R. L., Stein C. (2002) Introduction to algorithms. MIT Press, CambridgeGoogle Scholar
- 14.Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L. A., & Rothe J. (2007). Llull and Copeland voting broadly resist bribery and control. In Proceedings of AAAI’07 (pp. 724–730). Vancouver, Canada.Google Scholar
- 16.Fischer, F. A., Procaccia, A. D., & Samorodnitsky, A. (2009). A new perspective on implementation by voting trees. In Proceedings of EC’09 (pp. 31–40). Stanford, CA.Google Scholar
- 17.Fischer, F. A., Procaccia, A. D., & Samorodnitsky, A. (2010). A new perspective on implementation by voting trees. Random Structures and Algorithms. doi: 10.1002/rsa.20336.
- 19.Hazon, N., Aumann, Y., Kraus, S., & Wooldridge, M. (2008). Evaluation of election outcomes under uncertainty. In Proceedings of AAMAS’08 (Vol. 2, pp. 959–966). Estoril, Portugal.Google Scholar
- 20.Hazon, N., Dunne, P. E., Kraus, S., & Wooldridge, M. (2008). How to rig elections and competitions. In Proceedings of COMSOC’08, Liverpool, UK.Google Scholar
- 21.Konczak, K., & Lang, J. (2005). Voting procedures with incomplete preferences. In Proceedings of IJCAI’05 Multidisciplinary Workshop on Advances in Preference Handling, Edinburgh, Scotland, UK.Google Scholar
- 23.Lang, J., Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2007). Winner determination in sequential majority voting. In Proceedings of IJCAI’07 (pp. 1372–1377). Hyderabad, India.Google Scholar
- 27.Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2007). Incompleteness and incomparability in preference aggregation. In Proceedings of IJCAI’07 (pp. 1464–1469). Hyderabad, India.Google Scholar
- 28.Pini, M. S., Rossi, F., Venable, K. B., & Walsh T. (2008). Dealing with incomplete agents’ preferences and an uncertain agenda in group decision making via sequential majority voting. In Proceedings of KR’08 (pp. 571–578). Sydney, Australia.Google Scholar
- 29.Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2011). Possible and necessary winners in voting trees: Majority graphs vs. profiles. In Proceedings of AAMAS’11, Taipei, Taiwan.Google Scholar
- 30.Procaccia, A. D., Zohar, A., Peleg, Y., & Rosenschein, J. S. (2007). Learning voting trees. In Proceedings of AAAI’07 (pp. 110–115). Vancouver, BC, Canada.Google Scholar
- 33.Slater P. (1961) Inconsistencies in a schedule of paired comparisons. Biometrika 48(3–4): 303–312Google Scholar
- 34.Trick, M. (2006). Small binary voting trees. In Proceedings of COMSOC’06 (pp. 500–511). Amsterdam, Netherlands.Google Scholar
- 35.Vassilevska Williams, V. (2010). Fixing a tournament. In Proceedings of AAAI’10, Atlanta, GA.Google Scholar
- 36.Vu, T., Altman, A., & Shoham, Y. (2009). On the complexity of schedule control problems for knockout tournaments. In Proceedings of AAMAS’09 (Vol. 1, pp. 225–232). Budapest, Hungary.Google Scholar
- 37.Walsh, T. (2008). Complexity of terminating preference elicitation. In Proceedings of AAMAS’08 (pp. 967–974). Estoril, Portugal.Google Scholar
- 38.Xia, L., & Conitzer, V. (2008). Determining possible and necessary winners under common voting rules given partial orders. In Proceedings of AAAI’08 (pp. 196–201). Chicago, IL.Google Scholar
- 39.Xia, L., & Conitzer, V. (2010). Determining possible and necessary winners under common voting rules given partial orders. A longer unpublished version of . http://www.cs.duke.edu/~lxia.