{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:34:22Z","timestamp":1775734462873,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031975660","type":"print"},{"value":"9783031975677","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97567-7_29","type":"book-chapter","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T05:29:00Z","timestamp":1751520540000},"page":"366-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local Markovian Consensus for\u00a0Ranking Aggregation: A Novel Approach to\u00a0Weak Ordinal Dominance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8078-919X","authenticated-orcid":false,"given":"Joanna","family":"Ko\u0142odziejczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,4]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2023.109035","volume":"162","author":"P Andrieu","year":"2023","unstructured":"Andrieu, P., Cohen-Boulakia, S., Couceiro, M., Denise, A., Pierrot, A.: A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings. Int. J. Approx. Reason. 162, 109035 (2023). https:\/\/doi.org\/10.1016\/j.ijar.2023.109035","journal-title":"Int. J. Approx. Reason."},{"key":"29_CR2","doi-asserted-by":"publisher","unstructured":"Balestra, C., Ferrara, A., M\u00fcller, E.: FairMC Fair\u2013Markov chain rank aggregation methods. In: Wrembel, R., Chiusano, S., Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) Big Data Analytics and Knowledge Discovery, pp. 315\u2013321. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68323-7_26","DOI":"10.1007\/978-3-031-68323-7_26"},{"key":"29_CR3","doi-asserted-by":"publisher","unstructured":"Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825\u20133833 (2012). https:\/\/doi.org\/10.1016\/j.comnet.2012.10.007, the WEB we live in","DOI":"10.1016\/j.comnet.2012.10.007"},{"key":"29_CR4","doi-asserted-by":"publisher","unstructured":"Li, G., Xiao, Y., Wu, J.: Rank aggregation with limited information based on link prediction. Inf. Proc. Manag. 61(6), 103860 (2024). https:\/\/doi.org\/10.1016\/j.ipm.2024.103860","DOI":"10.1016\/j.ipm.2024.103860"},{"key":"29_CR5","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), vol. 21, no. 1, pp. 620\u2013626 (2006)"},{"key":"29_CR6","doi-asserted-by":"publisher","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 (WWW), pp. 613\u2013622. ACM (2001). https:\/\/doi.org\/10.1145\/371920.372165","DOI":"10.1145\/371920.372165"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Fischer, F., Hudry, O., Niedermeier, R.: Weighted tournament solutions. In: Handbook of Computational Social Choice, pp. 85\u2013102 (2016)","DOI":"10.1017\/CBO9781107446984.005"},{"key":"29_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10726-024-09876-y","author":"C Fu","year":"2024","unstructured":"Fu, C., Chang, W.: A Markov chain-based group consensus method with unknown parameters. Group Decis. Negot. (2024). https:\/\/doi.org\/10.1007\/s10726-024-09876-y","journal-title":"Group Decis. Negot."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-031-78468-2_17","volume-title":"Emerging Challenges in Intelligent Management Information Systems","author":"J Ko\u0142odziejczyk","year":"2024","unstructured":"Ko\u0142odziejczyk, J., Szyjewski, Z., Sa\u0142abun, W.: Markovian consensus based on local alternatives\u2019 relation. In: Hernes, M., W\u0105tr\u00f3bski, J., Rot, A. (eds.) Emerging Challenges in Intelligent Management Information Systems, pp. 224\u2013236. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78468-2_17"},{"key":"29_CR10","doi-asserted-by":"publisher","unstructured":"Kuhlman, C., Rault, P., Ravi, R.: Rank aggregation algorithms for fair consensus. Proc. VLDB Endow. 13(11), 2706\u20132719 (2020). https:\/\/doi.org\/10.14778\/3407790.3407855","DOI":"10.14778\/3407790.3407855"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.2016.1534","volume":"65","author":"S Negahban","year":"2017","unstructured":"Negahban, S., Oh, S., Shah, D.: Rank centrality: ranking from pairwise comparisons. Oper. Res. 65(1), 266\u2013287 (2017). https:\/\/doi.org\/10.1287\/opre.2016.1534","journal-title":"Oper. Res."},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0377-2217(03)00020-1","volume":"156","author":"S Opricovic","year":"2004","unstructured":"Opricovic, S., Tzeng, G.H.: The compromise solution by MCDM methods: a comparative analysis of VIKOR and TOPSIS. Eur. J. Oper. Res. 156(2), 445\u2013455 (2004). https:\/\/doi.org\/10.1016\/S0377-2217(03)00020-1","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR13","doi-asserted-by":"publisher","unstructured":"Wi\u0119ckowski, J., Sa\u0142abun, W.: Aggregating multi-criteria decision analysis results with a novel fuzzy ranking approach. In: 2024 IEEE 63rd Conference on Decision and Control (CDC), pp. 2958\u20132963 (2024). https:\/\/doi.org\/10.1109\/CDC56724.2024.10886467","DOI":"10.1109\/CDC56724.2024.10886467"},{"key":"29_CR14","unstructured":"Wu, X.M., Li, Z., So, A., Wright, J., Chang, S.F.: Learning with partially absorbing random walks. In: Pereira, F., Burges, C.J., Bottou, L., Weinberger, K.Q., (eds.) Advances in Neural Information Processing Systems, vol. 25. Curran Associates, Inc. (2012). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2012\/file\/512c5cad6c37edb98ae91c8a76c3a291-Paper.pdf"},{"key":"29_CR15","doi-asserted-by":"publisher","unstructured":"Xiao, Y., Deng, H.Z., Lu, X., J.W.: Graph-based rank aggregation method for high-dimensional and partial rankings. J. Oper. Res. Soc. 72(1), 227\u2013236 (2021). https:\/\/doi.org\/10.1080\/01605682.2019.1657365","DOI":"10.1080\/01605682.2019.1657365"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2025 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97567-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T05:29:05Z","timestamp":1751520545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97567-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031975660","9783031975677"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97567-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}