{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:32:47Z","timestamp":1762101167952,"version":"3.38.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,4,5]],"date-time":"2011-04-05T00:00:00Z","timestamp":1301961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10458-011-9171-8","type":"journal-article","created":{"date-parts":[[2011,4,4]],"date-time":"2011-04-04T04:27:48Z","timestamp":1301891268000},"page":"130-157","source":"Crossref","is-referenced-by-count":22,"title":["Winner determination in voting trees with incomplete preferences and weighted votes"],"prefix":"10.1007","volume":"25","author":[{"given":"J\u00e9r\u00f4me","family":"Lang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Silvia","family":"Pini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domenico","family":"Salvagnin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristen Brent","family":"Venable","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,5]]},"reference":[{"issue":"4","key":"9171_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF00649265","volume":"1","author":"J. S. Banks","year":"1985","unstructured":"Banks J. S. (1985) Sophisticated voting outcomes and agenda control. Social Choice and Welfare 1(4): 295\u2013306","journal-title":"Social Choice and Welfare"},{"key":"9171_CR2","doi-asserted-by":"crossref","unstructured":"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\u201910 (pp. 1019\u20131020). Lisbon, Portugal.","DOI":"10.3233\/978-1-60750-606-5-1019"},{"key":"9171_CR3","doi-asserted-by":"crossref","unstructured":"Betzler, N., & Dorn, B. (2009). Towards a dichotomy of finding possible winners in elections based on Scoring rules. In Proceedings of MFCS\u201909, Lecture notes in computer science (Vol. 5734, pp. 124\u2013136). Novy Smokovec, High Tatras, Slovakia.","DOI":"10.1007\/978-3-642-03816-7_12"},{"issue":"8","key":"9171_CR4","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1016\/j.jcss.2010.04.002","volume":"76","author":"N. Betzler","year":"2010","unstructured":"Betzler N., Dorn B. (2010) Towards a dichotomy for the possible winner problem in elections based on scoring rules. Journal of Computer and System Sciences 76(8): 812\u2013836","journal-title":"Journal of Computer and System Sciences"},{"key":"9171_CR5","unstructured":"Betzler, N., Hemmann, S., & Niedermeier, R. (2009). A multivariate complexity analysis of determining possible winners given incomplete votes. In Proceedings of IJCAI\u201909 (pp. 53\u201358). Pasadena, CA."},{"key":"9171_CR6","doi-asserted-by":"crossref","unstructured":"Brandt, F., Fischer, F., & Harrenstein, P. (2007). The computational complexity of choice sets. In Proceedings of TARK\u201907 (pp. 82\u201391). Brussels, Belgium.","DOI":"10.1145\/1324249.1324263"},{"issue":"4","key":"9171_CR7","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1002\/malq.200810027","volume":"55","author":"F. Brandt","year":"2009","unstructured":"Brandt F., Fischer F., Harrenstein P. (2009) The computational complexity of choice sets. Mathematical Logic Quarterly 55(4): 444\u2013459","journal-title":"Mathematical Logic Quarterly"},{"key":"9171_CR8","doi-asserted-by":"crossref","unstructured":"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\u201910, Atlanta, GA.","DOI":"10.1609\/aaai.v24i1.7640"},{"key":"9171_CR9","unstructured":"Conitzer, V., & Sandholm, T. (2002). Complexity of manipulating an election with few candidates. In Proceedings of AAAI\u201902 (pp. 314\u2013319). Edmonton, AB, Canada."},{"key":"9171_CR10","unstructured":"Conitzer, V., & Sandholm, T. (2002). Vote elicitation: Complexity and strategy-proofness. In Proceedings of AAAI\u201902 (pp. 392\u2013397). Edmonton, AB, Canada."},{"issue":"3","key":"9171_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1236457.1236461","volume":"54","author":"V. Conitzer","year":"2007","unstructured":"Conitzer V., Sandholm T., Lang J. (2007) When are elections with few candidates hard to manipulate. Journal of the ACM 54(3): 1\u201333","journal-title":"Journal of the ACM"},{"key":"9171_CR12","unstructured":"Copeland, A. H. (1951). A reasonable social welfare function. University of Michigan Seminar on Applications of Mathematics to the Social Sciences."},{"key":"9171_CR13","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"2002","unstructured":"Cormen T. H., Leiserson C. E., Rivest R. L., Stein C. (2002) Introduction to algorithms. MIT Press, Cambridge"},{"key":"9171_CR14","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L. A., & Rothe J. (2007). Llull and Copeland voting broadly resist bribery and control. In Proceedings of AAAI\u201907 (pp. 724\u2013730). Vancouver, Canada."},{"key":"9171_CR15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P. Faliszewski","year":"2009","unstructured":"Faliszewski P., Hemaspaandra E., Hemaspaandra L.A., Rothe J. (2009) Llull and Copeland voting computationally resist bribery and constructive control. Journal of Artificial Intelligence Research 35: 275\u2013341","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9171_CR16","doi-asserted-by":"crossref","unstructured":"Fischer, F. A., Procaccia, A. D., & Samorodnitsky, A. (2009). A new perspective on implementation by voting trees. In Proceedings of EC\u201909 (pp. 31\u201340). Stanford, CA.","DOI":"10.1145\/1566374.1566379"},{"key":"9171_CR17","doi-asserted-by":"crossref","unstructured":"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 .","DOI":"10.1002\/rsa.20336"},{"key":"9171_CR18","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey M. R., Johnson D. S. (1979) Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman, New York"},{"key":"9171_CR19","unstructured":"Hazon, N., Aumann, Y., Kraus, S., & Wooldridge, M. (2008). Evaluation of election outcomes under uncertainty. In Proceedings of AAMAS\u201908 (Vol. 2, pp. 959\u2013966). Estoril, Portugal."},{"key":"9171_CR20","unstructured":"Hazon, N., Dunne, P. E., Kraus, S., & Wooldridge, M. (2008). How to rig elections and competitions. In Proceedings of COMSOC\u201908, Liverpool, UK."},{"key":"9171_CR21","unstructured":"Konczak, K., & Lang, J. (2005). Voting procedures with incomplete preferences. In Proceedings of IJCAI\u201905 Multidisciplinary Workshop on Advances in Preference Handling, Edinburgh, Scotland, UK."},{"key":"9171_CR22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0165-4896(94)00778-7","volume":"30","author":"G. Laffond","year":"1995","unstructured":"Laffond G., Laslier J.-F., Le Breton M. (1995) Condorcet choice correspondences: A set-theoretical comparison. Mathematical Social Sciences 30: 23\u201335","journal-title":"Mathematical Social Sciences"},{"key":"9171_CR23","unstructured":"Lang, J., Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2007). Winner determination in sequential majority voting. In Proceedings of IJCAI\u201907 (pp. 1372\u20131377). Hyderabad, India."},{"key":"9171_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60805-6","volume-title":"Tournament solutions and majority voting","author":"J.-F. Laslier","year":"1997","unstructured":"Laslier J.-F. (1997) Tournament solutions and majority voting. Springer-Verlag, Heidelberg"},{"key":"9171_CR25","doi-asserted-by":"crossref","first-page":"68","DOI":"10.2307\/2110925","volume":"24","author":"N. Miller","year":"1980","unstructured":"Miller N. (1980) A new solution set for tournaments and majority voting: Further graph-theoretical approaches to the theory of voting. American Journal of Political Science 24: 68\u201369","journal-title":"American Journal of Political Science"},{"key":"9171_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CCOL0521360552","volume-title":"Axioms of cooperative decision making","author":"H. Moulin","year":"1988","unstructured":"Moulin H. (1988) Axioms of cooperative decision making. Cambridge University Press, Cambridge"},{"key":"9171_CR27","unstructured":"Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2007). Incompleteness and incomparability in preference aggregation. In Proceedings of IJCAI\u201907 (pp. 1464\u20131469). Hyderabad, India."},{"key":"9171_CR28","unstructured":"Pini, M. S., Rossi, F., Venable, K. B., & Walsh T. (2008). Dealing with incomplete agents\u2019 preferences and an uncertain agenda in group decision making via sequential majority voting. In Proceedings of KR\u201908 (pp. 571\u2013578). Sydney, Australia."},{"key":"9171_CR29","unstructured":"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\u201911, Taipei, Taiwan."},{"key":"9171_CR30","unstructured":"Procaccia, A. D., Zohar, A., Peleg, Y., & Rosenschein, J. S. (2007). Learning voting trees. In Proceedings of AAAI\u201907 (pp. 110\u2013115). Vancouver, BC, Canada."},{"issue":"12\u201313","key":"9171_CR31","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1016\/j.artint.2009.03.003","volume":"173","author":"A. D. Procaccia","year":"2009","unstructured":"Procaccia A. D., Zohar A., Peleg Y., Rosenschein J. S. (2009) The learnability of voting rules. Artificial Intelligence 173(12\u201313): 1133\u20131149","journal-title":"Artificial Intelligence"},{"issue":"2","key":"9171_CR32","doi-asserted-by":"crossref","first-page":"97","DOI":"10.2307\/2216143","volume":"6","author":"T. Schwartz","year":"1972","unstructured":"Schwartz T. (1972) Rationality and the myth of the maximum. Nous 6(2): 97\u2013117","journal-title":"Nous"},{"issue":"3\u20134","key":"9171_CR33","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1093\/biomet\/48.3-4.303","volume":"48","author":"P. Slater","year":"1961","unstructured":"Slater P. (1961) Inconsistencies in a schedule of paired comparisons. Biometrika 48(3\u20134): 303\u2013312","journal-title":"Biometrika"},{"key":"9171_CR34","unstructured":"Trick, M. (2006). Small binary voting trees. In Proceedings of COMSOC\u201906 (pp. 500\u2013511). Amsterdam, Netherlands."},{"key":"9171_CR35","unstructured":"Vassilevska Williams, V. (2010). Fixing a tournament. In Proceedings of AAAI\u201910, Atlanta, GA."},{"key":"9171_CR36","unstructured":"Vu, T., Altman, A., & Shoham, Y. (2009). On the complexity of schedule control problems for knockout tournaments. In Proceedings of AAMAS\u201909 (Vol. 1, pp. 225\u2013232). Budapest, Hungary."},{"key":"9171_CR37","unstructured":"Walsh, T. (2008). Complexity of terminating preference elicitation. In Proceedings of AAMAS\u201908 (pp. 967\u2013974). Estoril, Portugal."},{"key":"9171_CR38","unstructured":"Xia, L., & Conitzer, V. (2008). Determining possible and necessary winners under common voting rules given partial orders. In Proceedings of AAAI\u201908 (pp. 196\u2013201). Chicago, IL."},{"key":"9171_CR39","unstructured":"Xia, L., & Conitzer, V. (2010). Determining possible and necessary winners under common voting rules given partial orders. A longer unpublished version of [38]. http:\/\/www.cs.duke.edu\/~lxia ."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-011-9171-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-011-9171-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-011-9171-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T20:45:48Z","timestamp":1741121148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-011-9171-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,5]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9171"],"URL":"https:\/\/doi.org\/10.1007\/s10458-011-9171-8","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2011,4,5]]}}}