{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:46:20Z","timestamp":1773798380901,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031185298","type":"print"},{"value":"9783031185304","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-18530-4_4","type":"book-chapter","created":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:02:30Z","timestamp":1668985350000},"page":"51-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Top-k List Aggregation: Mathematical Formulations and\u00a0Polyhedral Comparisons"],"prefix":"10.1007","author":[{"given":"Sina","family":"Akbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adolfo R.","family":"Escobedo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,21]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s00453-008-9211-1","volume":"57","author":"N Ailon","year":"2010","unstructured":"Ailon, N.: Aggregation of partial rankings, $$p$$-ratings and top-$$m$$ lists. Algorithmica 57(2), 284\u2013300 (2010). https:\/\/doi.org\/10.1007\/s00453-008-9211-1","journal-title":"Algorithmica"},{"key":"4_CR2","unstructured":"Akbari, S., Escobedo, A.R.: Beyond Kemeny aggregation: theoretical and computational insights for robust ranking aggregation. Under review"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Akbari, S., Escobedo, A.R.: Lower bounds on Kemeny rank aggregation with non-strict rankings. In: 2021 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20138. IEEE (2021)","DOI":"10.1109\/SSCI50451.2021.9660119"},{"key":"4_CR4","unstructured":"Aslay, C., Barbieri, N., Bonchi, F., Baeza-Yates, R.: Online topic-aware influence maximization queries. In: EDBT, pp. 295\u2013306 (2014)"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"2204","DOI":"10.1214\/18-AOS1745","volume":"47","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Fan, J., Ma, C., Wang, K.: Spectral method and regularized MLE are both optimal for top-K ranking. Ann. Stat. 47(4), 2204 (2019)","journal-title":"Ann. Stat."},{"key":"4_CR7","unstructured":"Chierichetti, F., Dasgupta, A., Haddadan, S., Kumar, R., Lattanzi, S.: Mallows models for top-k lists. In: Advances in Neural Information Processing Systems, pp. 4382\u20134392 (2018)"},{"key":"4_CR8","unstructured":"Collas, F., Irurozki, E.: Concentric mixtures of mallows models for top-$$ k $$ rankings: sampling and identifiability. In: International Conference on Machine Learning, pp. 2079\u20132088. PMLR (2021)"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2005.03.048","volume":"172","author":"WD Cook","year":"2006","unstructured":"Cook, W.D.: Distance-based and ad hoc consensus models in ordinal preference ranking. Eur. J. Oper. Res. 172(2), 369\u2013385 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International Conference on World Wide Web, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., Vee, E.: Comparing and aggregating rankings with ties. In: Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 47\u201358 (2004)","DOI":"10.1145\/1055558.1055568"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top $$k$$ lists. SIAM J. Discrete Math. 17(1), 134\u2013160 (2003)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res. 22(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"issue":"285","key":"4_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/01621459.1959.10501503","volume":"54","author":"LA Goodman","year":"1959","unstructured":"Goodman, L.A., Kruskal, W.H.: Measures of association for cross classifications. II: further discussion and references. J. Am. Stat. Assoc. 54(285), 123\u2013163 (1959)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1\/2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika 30(1\/2), 81\u201393 (1938)","journal-title":"Biometrika"},{"issue":"1\/2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.2307\/2333244","volume":"44","author":"CL Mallows","year":"1957","unstructured":"Mallows, C.L.: Non-null ranking models. I. Biometrika 44(1\/2), 114\u2013130 (1957)","journal-title":"Biometrika"},{"issue":"8","key":"4_CR17","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1038\/nmeth.2016","volume":"9","author":"D Marbach","year":"2012","unstructured":"Marbach, D., et al.: Wisdom of crowds for robust gene network inference. Nat. Methods 9(8), 796\u2013804 (2012)","journal-title":"Nat. Methods"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"McCown, F., Nelson, M.L.: Agreeing to disagree: search engines and their public interfaces. In: Proceedings of the 7th ACM\/IEEE-CS Joint Conference on Digital Libraries, pp. 309\u2013318 (2007)","DOI":"10.1145\/1255175.1255237"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.neucom.2016.07.073","volume":"250","author":"G N\u00e1poles","year":"2017","unstructured":"N\u00e1poles, G., Falcon, R., Dikopoulou, Z., Papageorgiou, E., Bello, R., Vanhoof, K.: Weighted aggregation of partial rankings using ant colony optimization. Neurocomputing 250, 109\u2013120 (2017)","journal-title":"Neurocomputing"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3365375","volume":"11","author":"SE Oliveira","year":"2020","unstructured":"Oliveira, S.E., Diniz, V., Lacerda, A., Merschmanm, L., Pappa, G.L.: Is rank aggregation effective in recommender systems? An experimental analysis. ACM Trans. Intell. Syst. Technol. (TIST) 11(2), 1\u201326 (2020)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Pal, K., Michel, S.: Efficient similarity search across top-k lists under the Kendall\u2019s Tau distance. In: Proceedings of the 28th International Conference on Scientific and Statistical Database Management, pp. 1\u201312 (2016)","DOI":"10.1145\/2949689.2949709"},{"issue":"10","key":"4_CR22","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.3390\/math8101828","volume":"8","author":"F Pedroche","year":"2020","unstructured":"Pedroche, F., Conejero, J.A.: Corrected evolutive Kendall\u2019s $$\\tau $$ coefficients for incomplete rankings with ties: application to case of spotify lists. Mathematics 8(10), 1828 (2020)","journal-title":"Mathematics"},{"issue":"6","key":"4_CR23","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.is.2013.01.002","volume":"38","author":"R Varadarajan","year":"2013","unstructured":"Varadarajan, R., Farf\u00e1n, F., Hristidis, V.: Comparing top-k XML lists. Inf. Syst. 38(6), 820\u2013834 (2013)","journal-title":"Inf. Syst."},{"issue":"4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1287\/deca.2021.0433","volume":"18","author":"Y Yoo","year":"2021","unstructured":"Yoo, Y., Escobedo, A.R.: A new binary programming formulation and social choice property for Kemeny rank aggregation. Decis. Anal. 18(4), 296\u2013320 (2021)","journal-title":"Decis. Anal."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18530-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:02:43Z","timestamp":1668985363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18530-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031185298","9783031185304"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18530-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2022","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":"isco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isco2022.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"50","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":"24","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":"48% - 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":"4-5","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":"4-5","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)"}}]}}