{"id":"https://openalex.org/W4213456219","doi":"https://doi.org/10.1109/wsc52266.2021.9715371","title":"On the Convergence of Optimal Computing Budget Allocation Algorithms","display_name":"On the Convergence of Optimal Computing Budget Allocation Algorithms","publication_year":2021,"publication_date":"2021-12-12","ids":{"openalex":"https://openalex.org/W4213456219","doi":"https://doi.org/10.1109/wsc52266.2021.9715371"},"language":"en","primary_location":{"id":"doi:10.1109/wsc52266.2021.9715371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc52266.2021.9715371","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101524130","display_name":"Yanwen Li","orcid":"https://orcid.org/0000-0003-3221-0945"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yanwen Li","raw_affiliation_strings":["City University of Hong Kong,Department of Advanced Design and Systems Engineering,Kowloon,HONG KONG","Department of Advanced Design and Systems Engineering, City University of Hong Kong, Kowloon, HONG KONG"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"City University of Hong Kong,Department of Advanced Design and Systems Engineering,Kowloon,HONG KONG","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Advanced Design and Systems Engineering, City University of Hong Kong, Kowloon, HONG KONG","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076608196","display_name":"Siyang Gao","orcid":"https://orcid.org/0000-0002-3574-6393"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Siyang Gao","raw_affiliation_strings":["School of Data Science, City University of Hong Kong,Department of Advanced Design and Systems Engineering,Kowloon,HONG KONG","Department of Advanced Design and Systems Engineering, School of Data Science, City University of Hong Kong, Kowloon, HONG KONG"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Data Science, City University of Hong Kong,Department of Advanced Design and Systems Engineering,Kowloon,HONG KONG","institution_ids":["https://openalex.org/I168719708"]},{"raw_affiliation_string":"Department of Advanced Design and Systems Engineering, School of Data Science, City University of Hong Kong, Kowloon, HONG KONG","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I168719708"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30632608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998000264167786,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9997000098228455,"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/T11195","display_name":"Simulation Techniques and Applications","score":0.992900013923645,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.750391960144043},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.6673955917358398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6596004962921143},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6352701783180237},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.6263042688369751},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6213189959526062},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5344943404197693},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5189128518104553},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4776626527309418},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24116933345794678},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1564604938030243}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.750391960144043},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.6673955917358398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6596004962921143},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6352701783180237},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6263042688369751},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6213189959526062},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5344943404197693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5189128518104553},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4776626527309418},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24116933345794678},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1564604938030243},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc52266.2021.9715371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc52266.2021.9715371","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W600148761","https://openalex.org/W1536615069","https://openalex.org/W1553290137","https://openalex.org/W1698608285","https://openalex.org/W1998376807","https://openalex.org/W2015923411","https://openalex.org/W2037728958","https://openalex.org/W2039522160","https://openalex.org/W2042332971","https://openalex.org/W2065842544","https://openalex.org/W2078594829","https://openalex.org/W2085300404","https://openalex.org/W2108794978","https://openalex.org/W2122470810","https://openalex.org/W2144304907","https://openalex.org/W2145286212","https://openalex.org/W2146879621","https://openalex.org/W2158319693","https://openalex.org/W2335629539","https://openalex.org/W2601522716","https://openalex.org/W2607129756","https://openalex.org/W2782884958","https://openalex.org/W2949840421","https://openalex.org/W2950929549","https://openalex.org/W3145648774","https://openalex.org/W4212920552","https://openalex.org/W4242750327","https://openalex.org/W4243288537","https://openalex.org/W6632992360","https://openalex.org/W6732299562"],"related_works":["https://openalex.org/W4376155396","https://openalex.org/W2971351794","https://openalex.org/W1947085858","https://openalex.org/W2101991911","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W2040498587","https://openalex.org/W1494981348"],"abstract_inverted_index":{"This":[0,16],"paper":[1],"considers":[2],"a":[3,19,35],"well-known":[4],"ranking":[5],"and":[6,64,83,133],"selection":[7,58,72],"(R&#x0026;S)":[8],"framework,":[9],"called":[10],"optimal":[11],"computing":[12],"budget":[13],"allocation":[14],"(OCBA).":[15],"framework":[17],"includes":[18],"set":[20],"of":[21,28,53,56,93,100,119,142],"equations":[22,44],"that":[23,41,105],"optimally":[24],"determine":[25],"the":[26,50,54,61,65,98,110,120,139],"number":[27],"samples":[29,92],"allocated":[30],"to":[31,48],"each":[32,94],"design":[33,37,63],"in":[34,130],"finite":[36],"set.":[38],"Sample":[39],"allocations":[40],"satisfy":[42],"these":[43,143],"have":[45],"been":[46],"shown":[47],"be":[49],"asymptotic":[51],"optimizer":[52],"probability":[55],"correct":[57],"(PCS)":[59],"for":[60,91,103,123],"best":[62],"expected":[66],"opportunity":[67],"cost":[68],"(EOC)":[69],"if":[70],"false":[71],"occurs.":[73],"In":[74,114],"this":[75],"paper,":[76],"we":[77,116],"analyze":[78],"two":[79],"popular":[80],"OCBA":[81,111,121],"algorithms":[82,104,122,144],"study":[84],"their":[85,135],"convergence":[86,101,136,140],"rates,":[87],"assuming":[88],"known":[89],"variances":[90],"design.":[95],"It":[96],"fills":[97],"gap":[99],"analysis":[102],"are":[106,145],"developed":[107],"based":[108],"on":[109],"optimality":[112],"equations.":[113],"addition,":[115],"propose":[117],"modifications":[118],"cumulative":[124],"regret,":[125],"an":[126],"objective":[127],"commonly":[128],"studied":[129],"machine":[131],"learning,":[132],"derive":[134],"rates.":[137],"Last,":[138],"behaviors":[141],"demonstrated":[146],"using":[147],"numerical":[148],"examples.":[149]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}
