{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T05:38:10Z","timestamp":1751607490675,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_10","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"147-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Kemeny Rankings from d-Euclidean Preferences"],"prefix":"10.1007","author":[{"given":"Thekla","family":"Hamm","sequence":"first","affiliation":[]},{"given":"Martin","family":"Lackner","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Rapberger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"issue":"5","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 1\u201327 (2008)","journal-title":"J. ACM"},{"key":"10_CR2","first-page":"632","volume":"222","author":"JA Aledo","year":"2013","unstructured":"Aledo, J.A., G\u00e1mez, J.A., Molina, D.: Tackling the rank aggregation problem with evolutionary algorithms. Appl. Math. Comput. 222, 632\u2013644 (2013)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.mathsocsci.2011.08.008","volume":"64","author":"A Ali","year":"2012","unstructured":"Ali, A., Meil\u0103, M.: Experiments with Kemeny ranking: what works when? Math. Soc. Sci. 64(1), 28\u201340 (2012)","journal-title":"Math. Soc. Sci."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: SODA, pp. 522\u2013539. SIAM (2021)","DOI":"10.1137\/1.9781611976465.32"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1613\/jair.2306","volume":"31","author":"A Altman","year":"2008","unstructured":"Altman, A., Tennenholtz, M.: Axiomatic foundations for ranking systems. J. Artif. Intell. Res. 31, 473\u2013495 (2008)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.ejor.2019.08.033","volume":"281","author":"I Azzini","year":"2020","unstructured":"Azzini, I., Munda, G.: A new approach for identifying the Kemeny median ranking. Eur. J. Oper. Res. 281(2), 388\u2013401 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welf. 6(2), 157\u2013165 (1989)","journal-title":"Soc. Choice Welf."},{"issue":"45","key":"10_CR8","doi-asserted-by":"publisher","first-page":"4554","DOI":"10.1016\/j.tcs.2009.08.033","volume":"410","author":"N Betzler","year":"2009","unstructured":"Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410(45), 4554\u20134570 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1813","DOI":"10.1016\/j.disc.2007.12.088","volume":"309","author":"T Biedl","year":"2009","unstructured":"Biedl, T., Brandenburg, F.J., Deng, X.: On the complexity of crossings in permutations. Discrete Math. 309(7), 1813\u20131823 (2009)","journal-title":"Discrete Math."},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jmateco.2006.09.004","volume":"43","author":"A Bogomolnaia","year":"2007","unstructured":"Bogomolnaia, A., Laslier, J.F.: Euclidean preferences. J. Math. Econ. 43(2), 87\u201398 (2007)","journal-title":"J. Math. Econ."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1613\/jair.4647","volume":"53","author":"F Brandt","year":"2015","unstructured":"Brandt, F., Brill, M., Hemaspaandra, E., Hemaspaandra, L.A.: Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates. J. Artif. Intell. Res. 53, 439\u2013496 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Lee, Y.T., Miller, G., Pachocki, J., Sidford, A.: Geometric median in nearly linear time. In: STOC, pp. 9\u201321 (2016)","DOI":"10.1145\/2897518.2897647"},{"key":"10_CR13","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: AAAI, pp. 620\u2013626 (2006)"},{"key":"10_CR14","unstructured":"Cornaz, D., Galand, L., Spanjaard, O.: Kemeny elections with bounded single-peaked or single-crossing width. In: IJCAI, pp. 76\u201382 (2013)"},{"key":"10_CR15","unstructured":"Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: AAAI, pp. 697\u2013702 (2004)"},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1994.1010","volume":"16","author":"JP Doignon","year":"1994","unstructured":"Doignon, J.P., Falmagne, J.C.: A polynomial time algorithm for unidimensional unfolding representations. J. Algorithms 16(2), 218\u2013233 (1994)","journal-title":"J. Algorithms"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"10_CR18","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (2012)"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7155\/jgaa.00410","volume":"21","author":"P Eirinakis","year":"2017","unstructured":"Eirinakis, P., Williamson, M., Subramani, K.: On the Shoshan-Zwick algorithm for the all-pairs shortest path problem. J. Graph Algorithms Appl. 21(2), 177\u2013181 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"10_CR20","unstructured":"Elkind, E., Lackner, M., Peters, D.: Structured preferences. In: Trends in Computational Social Choice, chap. 10, pp. 187\u2013207. AI Access (2017)"},{"key":"10_CR21","unstructured":"Enelow, J., Hinich, M. (eds.): Advances in the Spatial Theory of Voting. Cambridge University Press, Cambridge (1990)"},{"key":"10_CR22","unstructured":"Ephrati, E., Rosenschein, J.S., et al.: Multi-agent planning as a dynamic search for social consensus. In: IJCAI, pp. 423\u2013429 (1993)"},{"issue":"8","key":"10_CR23","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1016\/j.dam.2007.05.035","volume":"156","author":"D Eppstein","year":"2008","unstructured":"Eppstein, D., Falmagne, J.C.: Algorithms for media. Discrete Appl. Math. 156(8), 1308\u20131320 (2008)","journal-title":"Discrete Appl. Math."},{"key":"10_CR24","unstructured":"Escoffier, B., Spanjaard, O., Tydrichova, M.: Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences. arXiv:2106.13054, preprint (2021)"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Godziszewski, M.T., Batko, P., Skowron, P., Faliszewski, P.: An analysis of approval-based committee rules for 2D-Euclidean elections. In: AAAI, pp. 5448\u20135455 (2021)","DOI":"10.1609\/aaai.v35i6.16686"},{"key":"10_CR26","unstructured":"Goodman, J., O\u2019Rourke, J., T\u00f3th, C.: Handbook of Discrete and Computational Geometry, 3rd edn. (2017)"},{"issue":"3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theor. Comput. Sci. 349(3), 382\u2013391 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC, pp. 95\u2013103 (2007)","DOI":"10.1145\/1250790.1250806"},{"issue":"1","key":"10_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmateco.2009.05.007","volume":"46","author":"V Knoblauch","year":"2010","unstructured":"Knoblauch, V.: Recognizing one-dimensional Euclidean preference profiles. J. Math. Econ. 46(1), 1\u20135 (2010)","journal-title":"J. Math. Econ."},{"issue":"2","key":"10_CR30","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1093\/pan\/mpj002","volume":"14","author":"JF Laslier","year":"2006","unstructured":"Laslier, J.F.: Spatial approval voting. Polit. Anal. 14(2), 160\u2013185 (2006)","journal-title":"Polit. Anal."},{"issue":"1","key":"10_CR31","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1093\/oxfordjournals.pan.a029804","volume":"8","author":"J Londregan","year":"1999","unstructured":"Londregan, J.: Estimating legislators\u2019 preferred points. Polit. Anal. 8(1), 35\u201356 (1999)","journal-title":"Polit. Anal."},{"key":"10_CR32","unstructured":"Pennock, D.M., Horvitz, E., Giles, C.L.: Social choice theory and recommender systems: analysis of the axiomatic foundations of collaborative filtering. In: AAAI, pp. 729\u2013734 (2000)"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Peters, D.: Recognising multidimensional Euclidean preferences. In: AAAI, pp. 642\u2013648 (2017)","DOI":"10.1609\/aaai.v31i1.10616"},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1613\/jair.1.11732","volume":"68","author":"D Peters","year":"2020","unstructured":"Peters, D., Lackner, M.: Preferences single-peaked on a circle. J. Artif. Intell. Res. 68, 463\u2013502 (2020)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"10_CR35","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2007.05.029","volume":"385","author":"V Popov","year":"2007","unstructured":"Popov, V.: Multiple genome rearrangement by swaps and by element duplications. Theor. Comput. Sci. 385(1), 115\u2013126 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"S Badal, P., Das, A.: Efficient algorithms using subiterative convergence for Kemeny ranking problem. Comput. Oper. Res. 98, 198\u2013210 (2018)","DOI":"10.1016\/j.cor.2018.06.007"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Shoshan, A., Zwick, U.: All pairs shortest paths in undirected graphs with integer weights. In: FOCS, pp. 605\u2013614. IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814635"},{"key":"10_CR38","unstructured":"Szufa, S., Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Drawing a map of elections in the space of statistical cultures. In: AAMAS, pp. 1341\u20131349 (2020)"},{"issue":"2","key":"10_CR39","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0135023","volume":"35","author":"HP Young","year":"1978","unstructured":"Young, H.P., Levenglick, A.: A consistent extension of condorcet\u2019s election principle. SIAM J. Appl. Math. 35(2), 285\u2013300 (1978)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10_CR40","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1257\/jep.9.1.51","volume":"9","author":"P Young","year":"1995","unstructured":"Young, P.: Optimal voting rules. J. Econ. Persp. 9(1), 51\u201364 (1995)","journal-title":"J. Econ. Persp."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T21:15:14Z","timestamp":1726002914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}