{"id":"https://openalex.org/W7166826863","doi":"https://doi.org/10.4230/lipics.icalp.2026.49","title":"A Scalable and Unified Framework to Weighted Rank Aggregation","display_name":"A Scalable and Unified Framework to Weighted Rank Aggregation","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166826863","doi":"https://doi.org/10.4230/lipics.icalp.2026.49"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26438","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.49","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.49/LIPIcs.ICALP.2026.49.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.49/LIPIcs.ICALP.2026.49.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074358236","display_name":"Amir Carmel","orcid":"https://orcid.org/0000-0002-0784-886X"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Carmel, Amir","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":"https://orcid.org/0000-0002-0784-886X","affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004420568","display_name":"Debarati Das","orcid":"https://orcid.org/0000-0003-2232-4279"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Das, Debarati","raw_affiliation_strings":["Pennsylvania State University, University Park, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-2232-4279","affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112876047","display_name":"Tien-Long Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nguyen, Tien-Long","raw_affiliation_strings":["Pennsylvania State University, University Park, PA, USA"],"raw_orcid":"https://orcid.org/0009-0007-9853-915X","affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.82110806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9732999801635742,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9732999801635742,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.004600000102072954,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.003599999938160181,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6432999968528748},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5665000081062317},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.564300000667572},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.5637000203132629},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5577999949455261},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5503000020980835},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5037999749183655}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6432999968528748},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5665000081062317},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.564300000667572},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.5637000203132629},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5577999949455261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5533000230789185},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5503000020980835},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5037999749183655},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4697999954223633},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4383000135421753},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42489999532699585},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.40619999170303345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38119998574256897},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3799999952316284},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36959999799728394},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35440000891685486},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.34470000863075256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33489999175071716},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.29319998621940613},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.26649999618530273},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25209999084472656}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26438","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.49","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.49/LIPIcs.ICALP.2026.49.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.49","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.49","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26438","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.49","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.49/LIPIcs.ICALP.2026.49.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6163045167922974,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166826863.pdf","grobid_xml":"https://content.openalex.org/works/W7166826863.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"rank":[1,8,72,149,161],"aggregation":[2,73,162],"problem,":[3],"seeks":[4],"to":[5,55,66,109,131,187,252,310],"combine":[6],"multiple":[7],"orderings":[9],"of":[10,14,47,63,115,194,204,229,259,297],"the":[11,41,52,61,123,132,164,170,188,226,253,277,282,295,311],"same":[12],"set":[13,46],"candidates":[15],"into":[16],"a":[17,45,57,97,103,112,128,143,156,179,182,191,205,239,242,256],"single":[18],"consensus":[19],"ordering.":[20],"Such":[21],"problems":[22],"arise":[23],"in":[24,169,190,200,212,255,265,273],"diverse":[25],"domains,":[26],"including":[27],"web":[28],"search,":[29],"employment,":[30],"college":[31],"admissions,":[32],"and":[33,85,207,224,231,267,293],"voting.":[34],"In":[35],"this":[36],"work":[37],"we":[38,154,237,291],"focus":[39,110],"on":[40,111,152],"1-median":[42,189,254,283],"objective:":[43],"given":[44],"m":[48],"rankings":[49,116],"over":[50],"[n],":[51],"goal":[53],"is":[54,284],"compute":[56],"ranking":[58],"that":[59,101,167,307],"minimizes":[60],"sum":[62],"its":[64],"distances":[65],"all":[67],"input":[68],"rankings.":[69],"We":[70,214],"study":[71],"under":[74,163],"several":[75],"classical":[76],"distance":[77,140,166],"metrics:":[78],"Ulam":[79,165,278],"distance,":[80,84,279],"Spearman\u2019s":[81,222],"footrule,":[82],"Hamming":[83,230],"Kendall-tau,":[86],"as":[87,89],"well":[88],"their":[90],"weighted":[91,148,312],"variants.":[92],"Our":[93,176],"contributions":[94],"begin":[95],"with":[96],"novel":[98],"unified":[99],"framework":[100,146],"identifies":[102],"key":[104],"structural":[105],"property:":[106],"it":[107],"suffices":[108],"small":[113],"subset":[114],"(of":[117],"size":[118,203],"three":[119],"or":[120,271],"five),":[121],"where":[122,280],"corresponding":[124],"local":[125,197,262],"one-median":[126],"provides":[127],"good":[129],"approximation":[130,158,219],"global":[133],"median.":[134],"This":[135],"principle":[136],"extends":[137,309],"across":[138,250],"these":[139],"measures,":[141],"yielding":[142],"general":[144],"algorithmic":[145],"for":[147,160,181,221,225,241,276],"aggregation.":[150],"Building":[151],"this,":[153],"present":[155],"new":[157,217],"algorithm":[159,177],"scales":[168],"Massively":[171],"Parallel":[172],"Computation":[173],"(MPC)":[174],"model.":[175],"computes":[178],"(2-\u03b1)-approximation,":[180],"constant":[183,192,243,257],"\u03b1":[184],">":[185,245],"0,":[186],"number":[193,258],"rounds,":[195,260],"using":[196,261],"memory":[198,209,263,269],"sublinear":[199,264],"n":[201,266],"(the":[202],"ranking)":[206],"total":[208,268],"near":[210],"linear":[211,270],"n.":[213,274],"further":[215,308],"design":[216],"MPC":[218],"algorithms":[220],"footrule":[223],"element-weighted":[227],"variants":[228],"Kendall-tau":[232],"distances.":[233],"For":[234],"each":[235],"metric,":[236],"obtain":[238],"(2-\u03b6)-approximation,":[240],"\u03b6":[244],"0":[246],"(which":[247],"may":[248],"differ":[249],"metrics),":[251],"near-linear":[272],"Moreover,":[275],"computing":[281],"NP-hard":[285],"[Fischer":[286],"et":[287,299],"al.,":[288],"ESA,":[289],"2025],":[290],"simplify":[292],"strengthen":[294],"analysis":[296],"Chakraborty":[298],"al.":[300],"[ITCS":[301],"2023],":[302],"obtaining":[303],"an":[304],"improved":[305],"1.968-approximation":[306],"setting.":[313]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-02T00:00:00"}