{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T22:37:39Z","timestamp":1774651059839,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642248726","type":"print"},{"value":"9783642248733","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24873-3_11","type":"book-chapter","created":{"date-parts":[[2011,10,11]],"date-time":"2011-10-11T07:08:48Z","timestamp":1318316928000},"page":"135-149","source":"Crossref","is-referenced-by-count":10,"title":["Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs"],"prefix":"10.1007","author":[{"given":"Tyler","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Craig","family":"Boutilier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-69507-3_4","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"Y. Chevaleyre","year":"2007","unstructured":"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\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 51\u201369. Springer, Heidelberg (2007)"},{"key":"11_CR2","unstructured":"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\u2013397 (2002)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"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\u201387 (2005)","DOI":"10.1145\/1064009.1064018"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02295838","volume":"69","author":"J.-P. Doignon","year":"2004","unstructured":"Doignon, J.-P., Pekec, A., Regenwetter, M.: The repeated insertion model for rankings: Missing link between two subset choice models. Psychometrika\u00a069(1), 33\u201354 (2004)","journal-title":"Psychometrika"},{"key":"11_CR5","series-title":"LSE Perspectives in Economic Analysis","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199297504.001.0001","volume-title":"A Primer in Social Choice Theory","author":"W. Gaertner","year":"2006","unstructured":"Gaertner, W.: A Primer in Social Choice Theory. LSE Perspectives in Economic Analysis. Oxford University Press, USA (August 2006)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10458-010-9133-6","volume":"22","author":"M. Kalech","year":"2011","unstructured":"Kalech, M., Kraus, S., Kaminka, G.A., Goldman, C.V.: Practical voting rules with partial information. Journal of Autonomous Agents and Multi-Agent Systems\u00a022(1), 151\u2013182 (2011)","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Kamishima, T., Kazawa, H., Akaho, S.: Supervised ordering: An empirical survey. In: IEEE International Conference on Data Mining, pp. 673\u2013676 (2005)","DOI":"10.1109\/ICDM.2005.138"},{"key":"11_CR8","unstructured":"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\u20131371 (2007)"},{"key":"11_CR9","unstructured":"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)"},{"key":"11_CR10","unstructured":"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)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1093\/biomet\/44.1-2.114","volume":"44","author":"C.L. Mallows","year":"1957","unstructured":"Mallows, C.L.: Non-null ranking models. Biometrika\u00a044, 114\u2013130 (1957)","journal-title":"Biometrika"},{"key":"11_CR12","volume-title":"Analyzing and modeling rank data","author":"J.I. Marden","year":"1995","unstructured":"Marden, J.I.: Analyzing and modeling rank data. Chapman and Hall, Boca Raton (1995)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/S0167-9473(02)00165-2","volume":"41","author":"T.B. Murphy","year":"2003","unstructured":"Murphy, T.B., Martin, D.: Mixtures of distance-based models for ranking data. Computational Statistics and Data Analysis\u00a041, 645\u2013655 (2003)","journal-title":"Computational Statistics and Data Analysis"},{"key":"11_CR14","volume-title":"Behavioral Social Choice: Probabilistic Models, Statistical Inference, and Applications","author":"M. Regenwetter","year":"2006","unstructured":"Regenwetter, M., Grofman, B., Marley, A.A.J., Tsetlin, I.: Behavioral Social Choice: Probabilistic Models, Statistical Inference, and Applications. Cambridge University Press, Cambridge (2006)"},{"issue":"11","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Communications of the ACM\u00a027(11), 1134\u20131142 (1984)","journal-title":"Communications of the ACM"},{"key":"11_CR16","unstructured":"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\u2013207 (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24873-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T18:07:41Z","timestamp":1741802861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24873-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248726","9783642248733"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24873-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}