{"id":"https://openalex.org/W2088597898","doi":"https://doi.org/10.1145/2808194.2809490","title":"Revisiting Optimal Rank Aggregation","display_name":"Revisiting Optimal Rank Aggregation","publication_year":2015,"publication_date":"2015-09-22","ids":{"openalex":"https://openalex.org/W2088597898","doi":"https://doi.org/10.1145/2808194.2809490","mag":"2088597898"},"language":"en","primary_location":{"id":"doi:10.1145/2808194.2809490","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2808194.2809490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 International Conference on The Theory of Information Retrieval","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024382157","display_name":"Shayan A. Tabrizi","orcid":"https://orcid.org/0000-0001-6839-8930"},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Shayan A. Tabrizi","raw_affiliation_strings":["University of Tehran, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tehran, Tehran, Iran","institution_ids":["https://openalex.org/I23946033"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069233580","display_name":"Javid Dadashkarimi","orcid":"https://orcid.org/0000-0002-1905-547X"},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Javid Dadashkarimi","raw_affiliation_strings":["University of Tehran, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tehran, Tehran, Iran","institution_ids":["https://openalex.org/I23946033"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102906366","display_name":"Mostafa Dehghani","orcid":"https://orcid.org/0000-0002-9772-1095"},"institutions":[{"id":"https://openalex.org/I4210135670","display_name":"Amsterdam University of the Arts","ror":"https://ror.org/04dde1554","country_code":"NL","type":"education","lineage":["https://openalex.org/I4210135670"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mostafa Dehghani","raw_affiliation_strings":["University of Amsterdam, Amsterdam, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I4210135670","https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063594369","display_name":"Hassan Nasr Esfahani","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hassan Nasr Esfahani","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055494428","display_name":"Azadeh Shakery","orcid":"https://orcid.org/0000-0003-1799-8340"},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Azadeh Shakery","raw_affiliation_strings":["University of Tehran, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tehran, Tehran, Iran","institution_ids":["https://openalex.org/I23946033"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5799,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67479441,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"353","last_page":"356"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/computer-science","display_name":"Computer science","score":0.7520484924316406},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.7025964260101318},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5779353380203247},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5464783906936646},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5281731486320496},{"id":"https://openalex.org/keywords/learning-to-rank","display_name":"Learning to rank","score":0.45735588669776917},{"id":"https://openalex.org/keywords/information-aggregation","display_name":"Information aggregation","score":0.4543759226799011},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44579222798347473},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4353606104850769},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40208256244659424},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3893875777721405},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.36304354667663574},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.337520569562912},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.30561721324920654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16410264372825623},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06592661142349243}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7520484924316406},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7025964260101318},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5779353380203247},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5464783906936646},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5281731486320496},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.45735588669776917},{"id":"https://openalex.org/C2986046992","wikidata":"https://www.wikidata.org/wiki/Q16773055","display_name":"Information aggregation","level":2,"score":0.4543759226799011},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44579222798347473},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4353606104850769},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40208256244659424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3893875777721405},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.36304354667663574},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.337520569562912},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.30561721324920654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16410264372825623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06592661142349243},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2808194.2809490","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2808194.2809490","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 International Conference on The Theory of Information Retrieval","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W54217079","https://openalex.org/W232533489","https://openalex.org/W1539345345","https://openalex.org/W1651688665","https://openalex.org/W1995485440","https://openalex.org/W2000635479","https://openalex.org/W2009077327","https://openalex.org/W2023142144","https://openalex.org/W2079391502","https://openalex.org/W2100774959","https://openalex.org/W2104679989","https://openalex.org/W2152577431","https://openalex.org/W2159829500","https://openalex.org/W4237886159","https://openalex.org/W6632246869"],"related_works":["https://openalex.org/W3127142483","https://openalex.org/W4385565564","https://openalex.org/W2898073868","https://openalex.org/W2138488530","https://openalex.org/W2971071571","https://openalex.org/W2798835721","https://openalex.org/W2387658907","https://openalex.org/W2922169395","https://openalex.org/W25098770","https://openalex.org/W2385796165"],"abstract_inverted_index":{"Rank":[0],"aggregation,":[1],"that":[2,76,103],"is":[3,8],"merging":[4],"multiple":[5],"ranked":[6],"lists,":[7],"a":[9,88],"pivotal":[10],"challenge":[11],"in":[12,19,114],"many":[13,115],"information":[14],"retrieval":[15],"(IR)":[16],"systems,":[17],"especially":[18],"distributed":[20],"IR":[21],"and":[22],"multilingual":[23],"IR.":[24],"From":[25],"the":[26,35,40,45,69,73,92,95,98,104,111],"evaluation":[27],"point":[28],"of":[29,37,39,94,97],"view,":[30],"being":[31],"able":[32],"to":[33,109,118],"calculate":[34],"upper-bound":[36],"performance":[38,75],"final":[41],"aggregated":[42,70],"list":[43,71],"lays":[44],"ground":[46],"for":[47,91],"evaluating":[48],"different":[49],"aggregation":[50,83],"strategies,":[51],"independently.":[52],"In":[53],"this":[54],"paper,":[55],"we":[56,101],"propose":[57],"an":[58],"algorithm":[59,107],"based":[60],"on":[61],"dynamic":[62],"programming":[63],"which,":[64],"using":[65],"relevancy":[66],"information,":[67],"obtains":[68],"with":[72],"maximum":[74],"could":[77],"be":[78],"possibly":[79],"achieved":[80],"by":[81],"any":[82],"strategy.":[84],"We":[85],"also":[86],"provide":[87],"detailed":[89],"proof":[90],"optimality":[93],"result":[96,113],"algorithm.":[99],"Furthermore,":[100],"demonstrate":[102],"previous":[105],"proposed":[106],"fails":[108],"reach":[110],"optimal":[112],"circumstances,":[116],"due":[117],"its":[119],"greedy":[120],"essence.":[121]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}