{"id":"https://openalex.org/W2078918447","doi":"https://doi.org/10.1145/1498698.1537601","title":"Ranking tournaments","display_name":"Ranking tournaments","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2078918447","doi":"https://doi.org/10.1145/1498698.1537601","mag":"2078918447"},"language":"en","primary_location":{"id":"doi:10.1145/1498698.1537601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1537601","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-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/A5067065114","display_name":"Tom Coleman","orcid":null},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Tom Coleman","raw_affiliation_strings":["The University of Melbourne","The University of Melbourne,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Melbourne","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"The University of Melbourne,","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087794199","display_name":"Anthony Wirth","orcid":"https://orcid.org/0000-0003-3746-6704"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Anthony Wirth","raw_affiliation_strings":["The University of Melbourne","The University of Melbourne,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Melbourne","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"The University of Melbourne,","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067065114"],"corresponding_institution_ids":["https://openalex.org/I165779595"],"apc_list":null,"apc_paid":null,"fwci":2.136,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91931034,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"14","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.9979000091552734,"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.9979000091552734,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.7160274386405945},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.703143298625946},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.5857605934143066},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.5539903044700623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46031567454338074},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4595325291156769},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4464593529701233},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44486624002456665},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4370284080505371},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4355519115924835},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4188710153102875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35173651576042175},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32541146874427795},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24555572867393494},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17871791124343872}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.7160274386405945},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.703143298625946},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.5857605934143066},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.5539903044700623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46031567454338074},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4595325291156769},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4464593529701233},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44486624002456665},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4370284080505371},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4355519115924835},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4188710153102875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35173651576042175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32541146874427795},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24555572867393494},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17871791124343872},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1498698.1537601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1537601","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6821172774","display_name":null,"funder_award_id":"DP0663979","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1564197095","https://openalex.org/W1749432580","https://openalex.org/W1965193466","https://openalex.org/W1972151695","https://openalex.org/W1979519377","https://openalex.org/W1986584538","https://openalex.org/W1986978101","https://openalex.org/W1988686126","https://openalex.org/W1988825590","https://openalex.org/W1999789113","https://openalex.org/W2003207175","https://openalex.org/W2016963000","https://openalex.org/W2051834357","https://openalex.org/W2058702778","https://openalex.org/W2066305510","https://openalex.org/W2082806890","https://openalex.org/W2083342911","https://openalex.org/W2091858563","https://openalex.org/W2095512455","https://openalex.org/W2167372977","https://openalex.org/W2199495299","https://openalex.org/W2318031348","https://openalex.org/W2326851176","https://openalex.org/W2401610261","https://openalex.org/W2914959486","https://openalex.org/W4236385439","https://openalex.org/W4252684946"],"related_works":["https://openalex.org/W4237161270","https://openalex.org/W2166399498","https://openalex.org/W2989488691","https://openalex.org/W1705888004","https://openalex.org/W2307149379","https://openalex.org/W3121675803","https://openalex.org/W61412736","https://openalex.org/W2742569245","https://openalex.org/W4298167438","https://openalex.org/W2963769221"],"abstract_inverted_index":{"Ranking":[0],"is":[1,23,28,34,45,53,66,79,101,108,116,241,269],"a":[2,16,35,47,83,111,123,155,180,255,261,278],"fundamental":[3],"activity":[4],"for":[5,150,186,204],"organizing":[6],"and,":[7],"later,":[8],"understanding":[9],"data.":[10],"Advice":[11],"of":[12,85,91,106,122,135,157,160,179,280],"the":[13,39,42,51,58,64,71,92,120,133,140,152,158,161,177],"form":[14],"\u201c":[15],"should":[17],"be":[18],"ranked":[19],"before":[20],"b":[21],"\u201d":[22],"given.":[24],"If":[25,50,63],"this":[26,192,259],"advice":[27,52,65,93,102],"consistent,":[29,54],"and":[30,41,199,214],"complete,":[31],"then":[32,57,68,80],"there":[33,100],"total":[36,256],"ordering":[37,119],"on":[38,145,189,211,243,277],"data":[40,281],"ranking":[43,114],"problem":[44,59,162],"essentially":[46],"sorting":[48],"problem.":[49,153],"but":[55],"incomplete,":[56],"becomes":[60],"topological":[61],"sorting.":[62],"inconsistent,":[67],"we":[69,194,229],"have":[70,235,248],"feedback":[72],"arc":[73],"set":[74,84],"(FAS)":[75],"problem:":[76],"The":[77,207],"aim":[78],"to":[81,87,118,129,166,254],"rank":[82],"items":[86,107],"satisfy":[88],"as":[89,94,110,270],"much":[90,142],"possible.":[95],"An":[96],"instance":[97],"in":[98,176,220],"which":[99],"about":[103],"every":[104],"pair":[105],"known":[109],"tournament.":[112],"This":[113],"task":[115],"equivalent":[117],"nodes":[121,247],"given":[124],"directed":[125],"graph":[126],"from":[127],"left":[128],"right,":[130],"while":[131],"minimizing":[132],"number":[134],"arcs":[136,245],"pointing":[137],"left.":[138],"In":[139,191],"past,":[141],"work":[143],"focused":[144],"finding":[146],"good,":[147],"effective":[148],"heuristics":[149],"solving":[151,187,205],"Recently,":[154],"proof":[156],"NP-completeness":[159],"(even":[163],"when":[164],"restricted":[165],"tournaments)":[167],"has":[168],"accompanied":[169],"new":[170,202,239],"algorithms":[171,198,208,223],"with":[172,260],"approximation":[173,184,236],"guarantees,":[174],"culminating":[175],"development":[178],"PTAS":[181],"(polynomial":[182],"time":[183],"scheme)":[185],"FAS":[188],"tournaments.":[190],"article,":[193],"reexamine":[195],"many":[196],"existing":[197,275],"develop":[200],"some":[201],"techniques":[203,276],"FAS.":[206],"are":[209,224],"tested":[210],"both":[212],"synthetic":[213],"nonsynthetic":[215],"datasets.":[216],"We":[217],"find":[218],"that,":[219],"practice,":[221],"local-search":[222,263],"very":[225],"powerful,":[226],"even":[227],"though":[228],"prove":[230],"that":[231,268],"they":[232],"do":[233],"not":[234],"guarantees.":[237],"Our":[238],"algorithm":[240,267],"based":[242],"reversing":[244],"whose":[246],"large":[249],"indegree":[250],"differences,":[251],"eventually":[252],"leading":[253],"ordering.":[257],"Combining":[258],"powerful":[262],"technique":[264],"yields":[265],"an":[266],"strong,":[271],"or":[272],"stronger":[273],"than,":[274],"variety":[279],"sets.":[282]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}