{"id":"https://openalex.org/W2810804998","doi":"https://doi.org/10.1109/allerton.2018.8636001","title":"On Learning the c\u03bc Rule in Single and Parallel Server Networks","display_name":"On Learning the c\u03bc Rule in Single and Parallel Server Networks","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2810804998","doi":"https://doi.org/10.1109/allerton.2018.8636001","mag":"2810804998"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2018.8636001","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8636001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5083476917","display_name":"Subhashini Krishnasamy","orcid":"https://orcid.org/0000-0001-5157-1258"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Subhashini Krishnasamy","raw_affiliation_strings":["Tata Institute of Fundamental Research"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research","institution_ids":["https://openalex.org/I11947397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022435379","display_name":"Ari Arapostathis","orcid":"https://orcid.org/0000-0003-2207-357X"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ari Arapostathis","raw_affiliation_strings":["The University of Texas at Austin"],"affiliations":[{"raw_affiliation_string":"The University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042177635","display_name":"Ramesh Johari","orcid":"https://orcid.org/0000-0002-3960-0770"},"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":"Ramesh Johari","raw_affiliation_strings":["Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028903768","display_name":"Sanjay Shakkottai","orcid":"https://orcid.org/0000-0002-4325-9050"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjay Shakkottai","raw_affiliation_strings":["The University of Texas at Austin"],"affiliations":[{"raw_affiliation_string":"The University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083476917"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":null,"apc_paid":null,"fwci":1.4823,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.8408393,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"153","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"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/T13553","display_name":"Age of Information Optimization","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/regret","display_name":"Regret","score":0.8880069255828857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6382215619087219},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6191229820251465},{"id":"https://openalex.org/keywords/holding-cost","display_name":"Holding cost","score":0.5151687860488892},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5131226181983948},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.43875280022621155},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.43010902404785156},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.4131321310997009},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4116175174713135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25361937284469604},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2176806628704071},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12378990650177002}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8880069255828857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6382215619087219},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6191229820251465},{"id":"https://openalex.org/C192365026","wikidata":"https://www.wikidata.org/wiki/Q5046829","display_name":"Holding cost","level":2,"score":0.5151687860488892},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5131226181983948},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.43875280022621155},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.43010902404785156},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.4131321310997009},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4116175174713135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25361937284469604},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2176806628704071},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12378990650177002},{"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.1109/allerton.2018.8636001","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8636001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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":6,"referenced_works":["https://openalex.org/W1911551976","https://openalex.org/W2009551863","https://openalex.org/W2168405694","https://openalex.org/W2949186496","https://openalex.org/W3165419553","https://openalex.org/W6639904974"],"related_works":["https://openalex.org/W2020328098","https://openalex.org/W1841788933","https://openalex.org/W4307705789","https://openalex.org/W2084006394","https://openalex.org/W2055520496","https://openalex.org/W2034049424","https://openalex.org/W2137580978","https://openalex.org/W2237203530","https://openalex.org/W2030120134","https://openalex.org/W2022738718"],"abstract_inverted_index":{"We":[0,45,72,150,183],"consider":[1],"learning-based":[2],"variants":[3],"of":[4,16,94,120,177],"the":[5,21,25,32,48,51,58,63,75,95,105,110,117,127,134,147,159,175],"c\u03bc":[6,26,64,135,160],"rule":[7,27,65,136],"for":[8,143,155],"scheduling":[9],"in":[10,85,104,122,139],"single":[11,22,106],"and":[12,40],"parallel":[13,128],"server":[14,23,107,129],"settings":[15],"multiclass":[17],"queueing":[18],"systems.":[19],"In":[20,126],"setting,":[24,130],"is":[28,92,197],"known":[29,67],"to":[30],"minimize":[31],"expected":[33],"holding-cost":[34,59,88,190],"(weighted":[35],"queue-lengths":[36],"summed":[37],"over":[38],"classes":[39],"a":[41,86,123,181,193],"fixed":[42],"time":[43,96],"horizon).":[44,97],"focus":[46],"on":[47],"problem":[49],"where":[50],"service":[52,82],"rates":[53,83,145],"\u03bc":[54],"are":[55],"unknown":[56],"with":[57,66],"regret":[60,89,91,191],"(regret":[61],"against":[62],"\u03bc)":[68],"as":[69],"our":[70],"objective.":[71],"show":[73,132,184],"that":[74,78,112,133,171,185],"greedy":[76,169],"algorithm":[77,170,187],"uses":[79],"empirically":[80],"learned":[81],"results":[84],"constant":[87,189],"(the":[90],"independent":[93],"This":[98],"free":[99,194],"exploration":[100,195],"can":[101],"be":[102],"explained":[103],"setting":[108],"by":[109],"fact":[111],"any":[113],"work-conserving":[114],"policy":[115],"obtains":[116],"same":[118],"number":[119,176],"samples":[121,178],"busy":[124],"cycle.":[125],"we":[131,165],"may":[137],"result":[138],"unstable":[140],"queues,":[141],"even":[142],"arrival":[144],"within":[146],"capacity":[148],"region.":[149],"then":[151],"present":[152],"sufficient":[153],"conditions":[154],"geometric":[156],"ergodicity":[157],"under":[158],"rule.":[161],"Using":[162],"these":[163],"results,":[164],"propose":[166],"an":[167],"almost":[168],"explores":[172],"only":[173],"when":[174],"falls":[179],"below":[180],"threshold.":[182],"this":[186],"delivers":[188],"because":[192],"condition":[196],"eventually":[198],"satisfied.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}