{"id":"https://openalex.org/W30978599","doi":"https://doi.org/10.65109/coni3202","title":"On the complexity of schedule control problems for knockout tournaments","display_name":"On the complexity of schedule control problems for knockout tournaments","publication_year":2009,"publication_date":"2009-05-10","ids":{"openalex":"https://openalex.org/W30978599","doi":"https://doi.org/10.65109/coni3202","mag":"30978599"},"language":"en","primary_location":{"id":"doi:10.65109/coni3202","doi":"https://doi.org/10.65109/coni3202","is_oa":false,"landing_page_url":"https://doi.org/10.65109/coni3202","pdf_url":null,"source":{"id":"https://openalex.org/S4306417597","display_name":"Adaptive Agents and Multi-Agents Systems","issn_l":"1548-8403","issn":["1548-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Joint Conference on Autonomous Agents and Multiagent Systems","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5066379714","display_name":"Thuc Vu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thuc Vu","raw_affiliation_strings":["Stanford University, California","#N#        Stanford University, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, California","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"#N#        Stanford University, California","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031869471","display_name":"Alon Altman","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alon Altman","raw_affiliation_strings":["Stanford University, California","#N#        Stanford University, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, California","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"#N#        Stanford University, California","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028913764","display_name":"Yoav Shoham","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yoav Shoham","raw_affiliation_strings":["Stanford University, California","#N#        Stanford University, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, California","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"#N#        Stanford University, California","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":25.4034,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.9934452,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"232"},"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.9326000213623047,"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.9326000213623047,"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.035999998450279236,"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/T11674","display_name":"Sports Analytics and Performance","score":0.022299999371170998,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knockout-tournaments","display_name":"knockout tournaments","score":0.9779999852180481},{"id":"https://openalex.org/keywords/tournament-scheduling","display_name":"tournament scheduling","score":0.7749999761581421},{"id":"https://openalex.org/keywords/schedule-control","display_name":"schedule control","score":0.8309999704360962},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.8999999761581421},{"id":"https://openalex.org/keywords/seeding","display_name":"seeding","score":0.6460000276565552},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9430000185966492},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.5630000233650208}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.8422465324401855},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7441141605377197},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6050602197647095},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5598353147506714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5565033555030823},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5137501955032349},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4826996326446533},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45590299367904663},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45402154326438904},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36480098962783813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3278355598449707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22999534010887146},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21164509654045105},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19122472405433655},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.65109/coni3202","doi":"https://doi.org/10.65109/coni3202","is_oa":false,"landing_page_url":"https://doi.org/10.65109/coni3202","pdf_url":null,"source":{"id":"https://openalex.org/S4306417597","display_name":"Adaptive Agents and Multi-Agents Systems","issn_l":"1548-8403","issn":["1548-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Joint Conference on Autonomous Agents and Multiagent Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.149.5459","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.5459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ifaamas.org/Proceedings/aamas09/pdf/01_Full%20Papers/04_23_FP_0767.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.180.4355","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.180.4355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/%7Ethucvu/papers/AAMAS09-scheduling.pdf","raw_type":"text"},{"id":"mag:30978599","doi":null,"is_oa":false,"landing_page_url":"http://ai.stanford.edu/people/shoham/www%20papers/VuAltmanShoham-AAMAS09.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306417597","display_name":"Adaptive Agents and Multi-Agents Systems","issn_l":"1548-8403","issn":["1548-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Adaptive Agents and Multi-Agents Systems","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W13690856","https://openalex.org/W176578283","https://openalex.org/W356477583","https://openalex.org/W1484675474","https://openalex.org/W1493942848","https://openalex.org/W1501800199","https://openalex.org/W1580922218","https://openalex.org/W1640822234","https://openalex.org/W1969872310","https://openalex.org/W1972375916","https://openalex.org/W1996017352","https://openalex.org/W2002252750","https://openalex.org/W2003296459","https://openalex.org/W2010119778","https://openalex.org/W2010628486","https://openalex.org/W2011039300","https://openalex.org/W2017690885","https://openalex.org/W2025604370","https://openalex.org/W2028133320","https://openalex.org/W2052177397","https://openalex.org/W2071270167","https://openalex.org/W2129280541","https://openalex.org/W2161392628","https://openalex.org/W2479567345","https://openalex.org/W2509082392","https://openalex.org/W3121127840","https://openalex.org/W4301853317"],"related_works":["https://openalex.org/W7099050735","https://openalex.org/W4410064489","https://openalex.org/W2945442873","https://openalex.org/W2803912439","https://openalex.org/W2952428348","https://openalex.org/W6891738326","https://openalex.org/W4393147581","https://openalex.org/W4393147731","https://openalex.org/W2408105292","https://openalex.org/W173833138"],"abstract_inverted_index":{"Knockout":[0],"tournaments":[1,25],"constitute":[2],"a":[3,12,63,70,76,82],"common":[4],"format":[5],"of":[6,15,31,40,57,81,84,96,113],"sporting":[7],"events,":[8],"and":[9,37,88,103],"also":[10],"model":[11,79],"specific":[13],"type":[14],"election":[16],"scheme":[17],"(namely,":[18],"sequential":[19],"pairwise":[20,85],"elimination":[21],"election).":[22],"In":[23,49],"such":[24],"the":[26,29,32,38,41,46,54,67,91,100,106,111,114,135,141],"designer":[27],"controls":[28],"shape":[30],"tournament":[33,58,64,108],"(a":[34],"binary":[35],"tree)":[36],"seeding":[39],"players":[42],"(their":[43],"assignment":[44],"to":[45,132,134,137],"tree":[47],"leaves).":[48],"this":[50],"paper":[51],"we":[52],"investigate":[53,90],"computational":[55],"complexity":[56,112],"schedule":[59],"control,":[60],"i.e.,":[61],"designing":[62],"that":[65],"maximizes":[66],"winning":[68,86],"probability":[69,101],"target":[71],"player.":[72],"We":[73],"start":[74],"with":[75],"generic":[77],"probabilistic":[78],"consisting":[80],"matrix":[83],"probabilities,":[87],"then":[89],"problem":[92,116,136],"under":[93],"two":[94],"types":[95],"constraint:":[97],"constraints":[98,104,123],"on":[99,105],"matrix,":[102],"allowable":[107],"structure.":[109],"While":[110],"general":[115],"is":[117],"as":[118],"yet":[119],"unknown,":[120],"these":[121],"various":[122],"--":[124,130],"all":[125],"naturally":[126],"occurring":[127],"in":[128],"practice":[129],"serve":[131],"push":[133],"one":[138],"side":[139],"or":[140,145],"other:":[142],"easy":[143],"(polynomial)":[144],"hard":[146],"(NP-complete).":[147]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}