{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:32:58Z","timestamp":1762101178839},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,5]],"date-time":"2011-06-05T00:00:00Z","timestamp":1307232000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soc Choice Welf"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00355-011-0555-0","type":"journal-article","created":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T12:09:18Z","timestamp":1307189358000},"page":"891-905","source":"Crossref","is-referenced-by-count":13,"title":["Rationalizations of Condorcet-consistent rules via distances of hamming type"],"prefix":"10.1007","volume":"39","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[]},{"given":"Arkadii","family":"Slinko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,5]]},"reference":[{"issue":"1","key":"555_CR1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0165-4896(87)90059-X","volume":"13","author":"N Baigent","year":"1987","unstructured":"Baigent N (1987) Metric rationalisation of social choice functions according to principles of social choice. Math Soc Sci 13(1): 59\u201365","journal-title":"Math Soc Sci"},{"key":"555_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S1574-0110(02)80008-X","volume-title":"Handbook of social choice and welfare, vol 1","author":"S Brams","year":"2002","unstructured":"Brams S, Fishburn P (2002) Voting procedures. In: Arrow K, Sen A, Suzumura K (eds) Handbook of social choice and welfare, vol 1. Elsevier, Amsterdam, pp 173\u2013236"},{"key":"555_CR3","unstructured":"Condorcet J (1785) Essai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. (Facsimile reprint of original published in Paris, 1972, by the Imprimerie Royale)"},{"key":"555_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R Downey","year":"1999","unstructured":"Downey R, Fellows M (1999) Parameterized complexity. Springer-Verlag, New York"},{"key":"555_CR5","doi-asserted-by":"crossref","unstructured":"Elkind E, Faliszewski P, Slinko A (2009) On distance rationalizability of some voting rules. In: Proceedings of the 12th conference on theoretical aspects of rationality and knowledge. ACM Press, Stanford, pp 108\u2013117","DOI":"10.1145\/1562814.1562831"},{"key":"555_CR6","doi-asserted-by":"crossref","unstructured":"Elkind E, Faliszewski P, Slinko, A (2010a) Good rationalizations of voting rules. In: Proceedings of the 24th AAAI conference on artificial intelligence. AAAI Press, Menlo Park, California, pp 774\u2013779","DOI":"10.1609\/aaai.v24i1.7607"},{"key":"555_CR7","unstructured":"Elkind E, Faliszewski P, Slinko A (2010b) On the role of distances in defining voting rules. In: Proceedings of the 9th international conference on autonomous agents and multiagent systems. International Foundation for Autonomous Agents and Multiagent Systems, Toronto, pp 375\u2013382"},{"key":"555_CR8","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski P, Hemaspaandra E, Hemaspaandra L (2009) How hard is bribery in elections?. J Artif Intell Res 35: 485\u2013532","journal-title":"J Artif Intell Res"},{"key":"555_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04880-1","volume-title":"The complexity theory companion","author":"L Hemaspaandra","year":"2002","unstructured":"Hemaspaandra L, Ogihara M (2002) The complexity theory companion. Springer-Verlag, New York"},{"key":"555_CR10","volume-title":"Rank correlation methods","author":"M Kendall","year":"1990","unstructured":"Kendall M, Gibbons J (1990) Rank correlation methods. Oxford University Press, Oxford"},{"issue":"2","key":"555_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s11238-005-5459-y","volume":"59","author":"C Klamler","year":"2005","unstructured":"Klamler C (2005a) Borda and Condorcet: some distance results. Theory Decis 59(2): 97\u2013109","journal-title":"Theory Decis"},{"issue":"3","key":"555_CR12","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/s00199-004-0467-7","volume":"25","author":"C Klamler","year":"2005","unstructured":"Klamler C (2005b) The Copeland rule and Condorcet\u2019s principle. Econ Theory 25(3): 745\u2013749","journal-title":"Econ Theory"},{"key":"555_CR13","volume-title":"Power, freedom, and voting","author":"T Meskanen","year":"2008","unstructured":"Meskanen T, Nurmi H (2008) Closeness counts in social choice. In: Braham M, Steffen F (eds) Power, freedom, and voting. Springer-Verlag, Heidelberg"},{"key":"555_CR14","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford University Press, Oxford"},{"issue":"2","key":"555_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00134214","volume":"13","author":"S Nitzan","year":"1981","unstructured":"Nitzan S (1981) Some measures of closeness to unanimity and their implications. Theory Decis 13(2): 129\u2013138","journal-title":"Theory Decis"},{"key":"555_CR16","volume-title":"Computational complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou C (1994) Computational complexity. Addison-Wesley, Reading"},{"issue":"4","key":"555_CR17","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s00224-002-1093-z","volume":"36","author":"J Rothe","year":"2003","unstructured":"Rothe J, Spakowski H, Vogel J (2003) Exact complexity of the winner problem for Young elections. Theory Comput Syst 36(4): 375\u2013386","journal-title":"Theory Comput Syst"},{"issue":"2","key":"555_CR18","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0022-0531(77)90012-6","volume":"16","author":"H Young","year":"1977","unstructured":"Young H (1977) Extending Condorcet\u2019s rule. J Econ Theory 16(2): 335\u2013353","journal-title":"J Econ Theory"}],"container-title":["Social Choice and Welfare"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-011-0555-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00355-011-0555-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-011-0555-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T06:21:35Z","timestamp":1686118895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00355-011-0555-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,5]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["555"],"URL":"https:\/\/doi.org\/10.1007\/s00355-011-0555-0","relation":{},"ISSN":["0176-1714","1432-217X"],"issn-type":[{"value":"0176-1714","type":"print"},{"value":"1432-217X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,5]]}}}