{"id":"https://openalex.org/W2045465809","doi":"https://doi.org/10.1109/allerton.2013.6736645","title":"A Lyapunov optimization approach to repeated stochastic games","display_name":"A Lyapunov optimization approach to repeated stochastic games","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2045465809","doi":"https://doi.org/10.1109/allerton.2013.6736645","mag":"2045465809"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2013.6736645","doi":"https://doi.org/10.1109/allerton.2013.6736645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2013.6736645","pdf_url":null,"source":{"id":"https://openalex.org/S4306417658","display_name":"Allerton Conference on Communication, Control, and Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5029961049","display_name":"Michael J. Neely","orcid":"https://orcid.org/0000-0003-3524-1587","observed_orcids":["https://orcid.org/0000-0003-3524-1587"]},"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":"Michael J. Neely","raw_affiliation_strings":["University of Southern California","[University of Southern California Los, Angeles, CA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southern California","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"[University of Southern California Los, Angeles, CA, USA]","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029961049"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":1.3384,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.80443901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1082","last_page":"1089"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9750999808311462,"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/T11031","display_name":"Game Theory and Applications","score":0.9750999808311462,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.0052999998442828655,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.004800000227987766,"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/lyapunov-optimization","display_name":"Lyapunov optimization","score":0.9549999833106995},{"id":"https://openalex.org/keywords/max-weight-scheduling","display_name":"max-weight scheduling","score":0.6869999766349792},{"id":"https://openalex.org/keywords/correlated-equilibrium","display_name":"correlated equilibrium","score":0.8259999752044678},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.8830000162124634},{"id":"https://openalex.org/keywords/online-decision-making","display_name":"online decision making","score":0.5740000009536743},{"id":"https://openalex.org/keywords/common-randomness","display_name":"common randomness","score":0.4580000042915344},{"id":"https://openalex.org/keywords/equilibrium-constraints","display_name":"equilibrium constraints","score":0.6549999713897705}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.8267562389373779},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.8010596036911011},{"id":"https://openalex.org/C101403955","wikidata":"https://www.wikidata.org/wiki/Q6707083","display_name":"Lyapunov optimization","level":5,"score":0.6344645619392395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6344128251075745},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.5894320607185364},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.584907591342926},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.5364819765090942},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.5327019691467285},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5180321335792542},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.5025064945220947},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.48859578371047974},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.4685674011707306},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.45086508989334106},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.44837862253189087},{"id":"https://openalex.org/C201364048","wikidata":"https://www.wikidata.org/wiki/Q2897085","display_name":"Sequential equilibrium","level":5,"score":0.4415074586868286},{"id":"https://openalex.org/C163630976","wikidata":"https://www.wikidata.org/wiki/Q964667","display_name":"Correlated equilibrium","level":5,"score":0.4120723605155945},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.39639604091644287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2995256185531616},{"id":"https://openalex.org/C191544260","wikidata":"https://www.wikidata.org/wiki/Q1238630","display_name":"Lyapunov exponent","level":3,"score":0.20557469129562378},{"id":"https://openalex.org/C37935115","wikidata":"https://www.wikidata.org/wiki/Q6707085","display_name":"Lyapunov redesign","level":4,"score":0.18906742334365845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09440559148788452},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.09284079074859619},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2777052490","wikidata":"https://www.wikidata.org/wiki/Q5072826","display_name":"Chaotic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2013.6736645","doi":"https://doi.org/10.1109/allerton.2013.6736645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2013.6736645","pdf_url":null,"source":{"id":"https://openalex.org/S4306417658","display_name":"Allerton Conference on Communication, Control, and Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1987497363","https://openalex.org/W1988716172","https://openalex.org/W2000093132","https://openalex.org/W2067050450","https://openalex.org/W2112794046","https://openalex.org/W2118929276","https://openalex.org/W2120344179","https://openalex.org/W2123893388","https://openalex.org/W2135663206","https://openalex.org/W2137152139","https://openalex.org/W2142782680","https://openalex.org/W2173655337","https://openalex.org/W4234761190","https://openalex.org/W4297972233"],"related_works":["https://openalex.org/W2000093132","https://openalex.org/W1498423097","https://openalex.org/W4417127604","https://openalex.org/W2952598226","https://openalex.org/W4211155248","https://openalex.org/W2114120924","https://openalex.org/W7034621059","https://openalex.org/W6964930950","https://openalex.org/W2108012841","https://openalex.org/W2016921112"],"abstract_inverted_index":{"This":[0,92],"paper":[1],"considers":[2],"a":[3,21,42,60,131,154],"time-varying":[4,134],"game":[5],"with":[6,159],"N":[7],"players.":[8],"Every":[9],"time":[10,46],"slot,":[11],"players":[12,55,81],"observe":[13],"their":[14,71],"own":[15],"random":[16],"events":[17,25],"and":[18,26,104],"then":[19],"take":[20],"control":[22,27],"action.":[23],"The":[24,37,73,136],"actions":[28,128],"affect":[29],"the":[30,99,119,143],"individual":[31],"utilities":[32,48],"earned":[33],"by":[34,78,126],"each":[35],"player.":[36],"goal":[38],"is":[39,96,108,115],"to":[40,50,59,90,98,110,152],"maximize":[41],"concave":[43],"function":[44],"of":[45,63,94,101,133,142],"average":[47],"subject":[49],"equilibrium":[51,74,95,103],"constraints.":[52],"Specifically,":[53],"participating":[54],"are":[56],"provided":[57],"access":[58],"common":[61],"source":[62],"randomness":[64],"from":[65],"which":[66],"they":[67,87],"can":[68,149],"optimally":[69],"correlate":[70],"decisions.":[72],"constraints":[75],"incentivize":[76],"participation":[77],"ensuring":[79],"that":[80,117],"cannot":[82],"earn":[83],"more":[84],"utility":[85],"if":[86],"choose":[88],"not":[89,139],"participate.":[91],"form":[93],"similar":[97,147],"notions":[100],"Nash":[102],"correlated":[105,156],"equilibrium,":[106,157],"but":[107],"simpler":[109],"attain.":[111],"A":[112,146],"Lyapunov":[113],"method":[114,148],"developed":[116],"solves":[118],"problem":[120],"in":[121],"an":[122],"online":[123],"max-weight":[124],"fashion":[125],"selecting":[127],"based":[129],"on":[130],"set":[132],"weights.":[135],"algorithm":[137],"does":[138],"require":[140],"knowledge":[141],"event":[144],"probabilities.":[145],"be":[150],"used":[151],"compute":[153],"standard":[155],"albeit":[158],"increased":[160],"complexity.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}