{"id":"https://openalex.org/W2103645088","doi":"https://doi.org/10.1137/060668857","title":"Ergodic Control of Continuous-Time Markov Chains with Pathwise Constraints","display_name":"Ergodic Control of Continuous-Time Markov Chains with Pathwise Constraints","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2103645088","doi":"https://doi.org/10.1137/060668857","mag":"2103645088"},"language":"en","primary_location":{"id":"doi:10.1137/060668857","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060668857","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Control and Optimization","raw_type":"journal-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/A5002012512","display_name":"Tom\u00e1s Prieto-Rumeau","orcid":"https://orcid.org/0000-0003-4677-4725"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tom\u00e1s Prieto-Rumeau","raw_affiliation_strings":["tprieto@ccia.uned.es#TAB#"],"affiliations":[{"raw_affiliation_string":"tprieto@ccia.uned.es#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060670677","display_name":"On\u00e9simo Hern\u00e1ndez\u2013Lerma","orcid":"https://orcid.org/0000-0003-3308-5218"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"On\u00e9simo Hern\u00e1ndez-Lerma","raw_affiliation_strings":["ohernand@math.cinvestav.mx#TAB#"],"affiliations":[{"raw_affiliation_string":"ohernand@math.cinvestav.mx#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002012512"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8786,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.9452338,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"47","issue":"4","first_page":"1888","last_page":"1908"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.940500020980835,"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"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9318000078201294,"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/mathematics","display_name":"Mathematics","score":0.792611837387085},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.7361359596252441},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6604001522064209},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.5696202516555786},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5350813269615173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5240473747253418},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5072686076164246},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4752892255783081},{"id":"https://openalex.org/keywords/ergodicity","display_name":"Ergodicity","score":0.466977596282959},{"id":"https://openalex.org/keywords/sample-space","display_name":"Sample space","score":0.45123985409736633},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.41250890493392944},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.41200998425483704},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3402605950832367},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15106043219566345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1501758098602295},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10965156555175781}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.792611837387085},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.7361359596252441},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6604001522064209},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.5696202516555786},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5350813269615173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5240473747253418},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5072686076164246},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4752892255783081},{"id":"https://openalex.org/C201779956","wikidata":"https://www.wikidata.org/wiki/Q5426803","display_name":"Ergodicity","level":2,"score":0.466977596282959},{"id":"https://openalex.org/C100279318","wikidata":"https://www.wikidata.org/wiki/Q467440","display_name":"Sample space","level":2,"score":0.45123985409736633},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.41250890493392944},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.41200998425483704},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3402605950832367},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15106043219566345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1501758098602295},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10965156555175781},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/060668857","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060668857","pdf_url":null,"source":{"id":"https://openalex.org/S897311980","display_name":"SIAM Journal on Control and Optimization","issn_l":"0363-0129","issn":["0363-0129","1095-7138"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Control and Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"id":"https://metadata.un.org/sdg/3","display_name":"Good health and well-being"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1971879416","https://openalex.org/W1975162409","https://openalex.org/W1984006577","https://openalex.org/W1985760175","https://openalex.org/W1996452326","https://openalex.org/W2021290840","https://openalex.org/W2027614944","https://openalex.org/W2029559833","https://openalex.org/W2030565368","https://openalex.org/W2035161584","https://openalex.org/W2044387322","https://openalex.org/W2053508727","https://openalex.org/W2068098627","https://openalex.org/W2086234877","https://openalex.org/W2094897152","https://openalex.org/W2099275099","https://openalex.org/W2124102642","https://openalex.org/W2133626316","https://openalex.org/W2150301222","https://openalex.org/W2158800767","https://openalex.org/W2162061238","https://openalex.org/W2171098928","https://openalex.org/W4240133570"],"related_works":["https://openalex.org/W1972942382","https://openalex.org/W2009962825","https://openalex.org/W1722744795","https://openalex.org/W124275629","https://openalex.org/W2136727990","https://openalex.org/W2950014027","https://openalex.org/W2952991236","https://openalex.org/W964575223","https://openalex.org/W4296948412","https://openalex.org/W2358718285"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3,11,32,62,88,102],"unichain":[4],"ergodic":[5],"continuous-time":[6],"controlled":[7],"Markov":[8],"chains":[9],"(CMCs)":[10],"a":[12,40,52,59,110],"denumerable":[13],"state":[14],"space":[15],"and":[16,113],"possibly":[17],"unbounded":[18,24],"reward":[19,43,86],"rates":[20],"as":[21,23],"well":[22],"transition":[25],"rates.":[26],"The":[27],"problem":[28,101],"we":[29,70,82,93],"are":[30],"concerned":[31],"is":[33,57],"to":[34,97],"find":[35],"control":[36,100,108],"policies":[37,49],"that":[38],"maximize":[39],"sample-path":[41,77],"average":[42,55,78,85],"over":[44],"the":[45,74,107,118],"family":[46],"of":[47,76,109,120],"admissible":[48],"for":[50,73],"which":[51],"certain":[53],"pathwise":[54,103],"cost":[56],"below":[58],"given":[60],"value":[61],"probability":[63],"one.":[64],"To":[65],"study":[66],"this":[67],"problem,":[68],"first,":[69],"give":[71],"conditions":[72],"existence":[75],"optimal":[79],"policies.":[80],"Then":[81],"analyze":[83],"constrained":[84],"CMCs":[87],"\u201cexpected\u201d":[89],"constraints,":[90],"and,":[91],"finally,":[92],"apply":[94],"these":[95],"results":[96],"our":[98,121],"original":[99],"constraints.":[104],"Examples":[105],"on":[106],"queueing":[111],"system":[112],"an":[114],"epidemic":[115],"process":[116],"illustrate":[117],"feasibility":[119],"approach.":[122]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}