{"id":"https://openalex.org/W2041205077","doi":"https://doi.org/10.1109/secon.2012.6275789","title":"Online learning for combinatorial network optimization with restless Markovian rewards","display_name":"Online learning for combinatorial network optimization with restless Markovian rewards","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2041205077","doi":"https://doi.org/10.1109/secon.2012.6275789","mag":"2041205077"},"language":"en","primary_location":{"id":"doi:10.1109/secon.2012.6275789","is_oa":false,"landing_page_url":"https://doi.org/10.1109/secon.2012.6275789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)","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/A5011040174","display_name":"Yi Gai","orcid":null},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yi Gai","raw_affiliation_strings":["Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","[Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, USA]"],"affiliations":[{"raw_affiliation_string":"Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"[Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, USA]","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063784062","display_name":"Bhaskar Krishnamachari","orcid":"https://orcid.org/0000-0002-9994-9931"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bhaskar Krishnamachari","raw_affiliation_strings":["Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","[Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, USA]"],"affiliations":[{"raw_affiliation_string":"Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"[Ming Hsieh Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, USA]","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101967011","display_name":"Mingyan Liu","orcid":"https://orcid.org/0000-0003-3295-9200"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mingyan Liu","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA","Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011040174"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":4.5528,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.94416816,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"29","issue":null,"first_page":"28","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9950000047683716,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7363372445106506},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6399856805801392},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.574899435043335},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5704712867736816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5595530867576599},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5237731337547302},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5081510543823242},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4770873486995697},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.44196581840515137},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4232233464717865},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4201894700527191},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.41711172461509705},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4162679612636566},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35123521089553833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31221169233322144},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23899099230766296},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17803558707237244},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1139405369758606}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7363372445106506},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6399856805801392},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.574899435043335},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5704712867736816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5595530867576599},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5237731337547302},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5081510543823242},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4770873486995697},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.44196581840515137},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4232233464717865},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4201894700527191},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.41711172461509705},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4162679612636566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35123521089553833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31221169233322144},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23899099230766296},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17803558707237244},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1139405369758606},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/secon.2012.6275789","is_oa":false,"landing_page_url":"https://doi.org/10.1109/secon.2012.6275789","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)","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":27,"referenced_works":["https://openalex.org/W1666230842","https://openalex.org/W1833992807","https://openalex.org/W1985380836","https://openalex.org/W2000080679","https://openalex.org/W2009551863","https://openalex.org/W2015056750","https://openalex.org/W2041205077","https://openalex.org/W2047702649","https://openalex.org/W2059608229","https://openalex.org/W2093562354","https://openalex.org/W2113733815","https://openalex.org/W2120015434","https://openalex.org/W2120125372","https://openalex.org/W2125724988","https://openalex.org/W2140571193","https://openalex.org/W2148250692","https://openalex.org/W2157146750","https://openalex.org/W2168405694","https://openalex.org/W2169528473","https://openalex.org/W2222512263","https://openalex.org/W2227557434","https://openalex.org/W2962764550","https://openalex.org/W2963007414","https://openalex.org/W4232620022","https://openalex.org/W4285719527","https://openalex.org/W6637310442","https://openalex.org/W6654532046"],"related_works":["https://openalex.org/W2971351794","https://openalex.org/W4376155396","https://openalex.org/W1947085858","https://openalex.org/W2101991911","https://openalex.org/W2970347269","https://openalex.org/W4287863949","https://openalex.org/W4287102143","https://openalex.org/W1850488217","https://openalex.org/W2945119207","https://openalex.org/W3182614517"],"abstract_inverted_index":{"Combinatorial":[0],"network":[1,18],"optimization":[2],"algorithms":[3],"that":[4,44,91,104,121],"compute":[5],"optimal":[6],"structures":[7],"taking":[8],"into":[9],"account":[10],"edge":[11,56],"weights":[12,57],"form":[13],"the":[14,39,47,54,81,94,106,112,125],"foundation":[15],"for":[16],"many":[17],"protocols.":[19],"Examples":[20],"include":[21],"shortest":[22],"path":[23],"routing,":[24],"minimal":[25],"spanning":[26],"tree":[27],"computation,":[28],"maximum":[29],"weighted":[30],"matching":[31],"on":[32],"bipartite":[33],"graphs,":[34],"etc.":[35],"We":[36,97],"present":[37],"CLRMR,":[38],"first":[40],"online":[41,70],"learning":[42,71],"algorithm":[43,72],"efficiently":[45],"solves":[46],"stochastic":[48],"version":[49],"of":[50,68,77,127],"these":[51],"problems":[52],"where":[53],"underlying":[55],"vary":[58],"as":[59,80],"independent":[60],"Markov":[61,107],"chains":[62],"with":[63],"unknown":[64],"dynamics.":[65],"The":[66],"performance":[67],"an":[69],"is":[73,122],"characterized":[74],"in":[75,84,124,131],"terms":[76],"regret,":[78],"defined":[79],"cumulative":[82],"difference":[83],"rewards":[85],"between":[86],"a":[87,102],"suitably-defined":[88],"genie,":[89],"and":[90,110,129],"obtained":[92],"by":[93],"given":[95],"algorithm.":[96],"prove":[98],"that,":[99],"compared":[100],"to":[101],"genie":[103],"knows":[105],"transition":[108],"matrices":[109],"uses":[111],"single-best":[113],"structure":[114],"at":[115],"all":[116],"times,":[117],"CLRMR":[118],"yields":[119],"regret":[120],"polynomial":[123],"number":[126],"edges":[128],"nearly-logarithmic":[130],"time.":[132]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}