{"id":"https://openalex.org/W2060248504","doi":"https://doi.org/10.1016/s0005-1098(98)00153-8","title":"Risk-sensitive and minimax control of discrete-time, finite-state Markov decision processes","display_name":"Risk-sensitive and minimax control of discrete-time, finite-state Markov decision processes","publication_year":1999,"publication_date":"1999-02-01","ids":{"openalex":"https://openalex.org/W2060248504","doi":"https://doi.org/10.1016/s0005-1098(98)00153-8","mag":"2060248504"},"language":"en","primary_location":{"id":"doi:10.1016/s0005-1098(98)00153-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0005-1098(98)00153-8","pdf_url":null,"source":{"id":"https://openalex.org/S51360982","display_name":"Automatica","issn_l":"0005-1098","issn":["0005-1098","1873-2836"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drum.lib.umd.edu/bitstreams/1d1a9bd4-b0df-4302-9e51-16d3de0fb27e/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051570075","display_name":"Stefano Coraluppi","orcid":"https://orcid.org/0000-0003-0071-0654"},"institutions":[{"id":"https://openalex.org/I4210159818","display_name":"Alpha Environmental (United States)","ror":"https://ror.org/05j2afk93","country_code":"US","type":"company","lineage":["https://openalex.org/I4210159818"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Stefano P. Coraluppi","raw_affiliation_strings":["ALPHATECH, Inc., 50 Mall Road, Burlington, MA 01803, USA","ALPHATECH, Inc., 50 Mall Road, Burlington, MA 01803, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ALPHATECH, Inc., 50 Mall Road, Burlington, MA 01803, USA","institution_ids":[]},{"raw_affiliation_string":"ALPHATECH, Inc., 50 Mall Road, Burlington, MA 01803, USA#TAB#","institution_ids":["https://openalex.org/I4210159818"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013807415","display_name":"Steven I. Marcus","orcid":"https://orcid.org/0000-0002-4926-9567"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven I. Marcus","raw_affiliation_strings":["Department of Electrical Engineering and Institute for Systems Research, University of Maryland at College Park, MD 20742, USA","Department of Electrical Engineering and Institute for Systems Research, University of Maryland at College Park, MD 20742, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Institute for Systems Research, University of Maryland at College Park, MD 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Electrical Engineering and Institute for Systems Research, University of Maryland at College Park, MD 20742, USA#TAB#","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051570075"],"corresponding_institution_ids":["https://openalex.org/I4210159818"],"apc_list":{"value":3500,"currency":"USD","value_usd":3500},"apc_paid":null,"fwci":0.5158,"has_fulltext":true,"cited_by_count":84,"citation_normalized_percentile":{"value":0.75525138,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"35","issue":"2","first_page":"301","last_page":"309"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9577999711036682,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9577999711036682,"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/T12137","display_name":"Economic theories and models","score":0.9513000249862671,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9483000040054321,"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/minimax","display_name":"Minimax","score":0.886799156665802},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.8284602165222168},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6932482719421387},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.5454566478729248},{"id":"https://openalex.org/keywords/discrete-time-and-continuous-time","display_name":"Discrete time and continuous time","score":0.5256249308586121},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5066404938697815},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.49568068981170654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47736239433288574},{"id":"https://openalex.org/keywords/horizon","display_name":"Horizon","score":0.4738262891769409},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.4650712013244629},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4587348997592926},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4522729814052582},{"id":"https://openalex.org/keywords/decision-theory","display_name":"Decision theory","score":0.4299355745315552},{"id":"https://openalex.org/keywords/optimal-decision","display_name":"Optimal decision","score":0.41481178998947144},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4116242229938507},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39289402961730957},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.37009111046791077},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12237569689750671},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.0963239073753357},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0866614282131195}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.886799156665802},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.8284602165222168},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6932482719421387},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.5454566478729248},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.5256249308586121},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5066404938697815},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.49568068981170654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47736239433288574},{"id":"https://openalex.org/C159176650","wikidata":"https://www.wikidata.org/wiki/Q43261","display_name":"Horizon","level":2,"score":0.4738262891769409},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.4650712013244629},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4587348997592926},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4522729814052582},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.4299355745315552},{"id":"https://openalex.org/C150325174","wikidata":"https://www.wikidata.org/wiki/Q4335500","display_name":"Optimal decision","level":3,"score":0.41481178998947144},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4116242229938507},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39289402961730957},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.37009111046791077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12237569689750671},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.0963239073753357},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0866614282131195},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s0005-1098(98)00153-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0005-1098(98)00153-8","pdf_url":null,"source":{"id":"https://openalex.org/S51360982","display_name":"Automatica","issn_l":"0005-1098","issn":["0005-1098","1873-2836"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatica","raw_type":"journal-article"},{"id":"pmh:oai:drum.lib.umd.edu:1903/5948","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/5948","pdf_url":"https://drum.lib.umd.edu/bitstreams/1d1a9bd4-b0df-4302-9e51-16d3de0fb27e/download","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.46.5590","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.5590","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ee.umd.edu/~stefano/paper1.ps","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/5948","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/5948","pdf_url":"https://drum.lib.umd.edu/bitstreams/1d1a9bd4-b0df-4302-9e51-16d3de0fb27e/download","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2060248504.pdf","grobid_xml":"https://content.openalex.org/works/W2060248504.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W112736823","https://openalex.org/W1574786337","https://openalex.org/W1977384799","https://openalex.org/W1992154527","https://openalex.org/W2001432227","https://openalex.org/W2027591506","https://openalex.org/W2030695511","https://openalex.org/W2034725503","https://openalex.org/W2057338828","https://openalex.org/W2058397079","https://openalex.org/W2087873196","https://openalex.org/W2088413745","https://openalex.org/W2096035449","https://openalex.org/W2106929622","https://openalex.org/W2120006201","https://openalex.org/W2132807882","https://openalex.org/W2138740914","https://openalex.org/W2140282437","https://openalex.org/W2180192350","https://openalex.org/W2498694880"],"related_works":["https://openalex.org/W2022982950","https://openalex.org/W2477592680","https://openalex.org/W4233294812","https://openalex.org/W4245199094","https://openalex.org/W4250794450","https://openalex.org/W4245301552","https://openalex.org/W2104073004","https://openalex.org/W2766512981","https://openalex.org/W1986822856","https://openalex.org/W2179412118"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}
