{"id":"https://openalex.org/W7160867365","doi":"https://doi.org/10.48550/arxiv.2605.07459","title":"On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets","display_name":"On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets","publication_year":2026,"publication_date":"2026-05-08","ids":{"openalex":"https://openalex.org/W7160867365","doi":"https://doi.org/10.48550/arxiv.2605.07459"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.07459","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07459","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.07459","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135878768","display_name":"Ali Asadi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Asadi, Ali","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135908913","display_name":"Krishnendu Chatterjee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chatterjee, Krishnendu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135869995","display_name":"Alipasha Montaseri","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Montaseri, Alipasha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005733468","display_name":"Ali Shafiee","orcid":"https://orcid.org/0000-0002-6423-9315"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shafiee, Ali","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.6313999891281128,"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.6313999891281128,"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/T10142","display_name":"Formal Methods in Verification","score":0.07900000363588333,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.05420000106096268,"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/class","display_name":"Class (philosophy)","score":0.6123999953269958},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6007999777793884},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5681999921798706},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45410001277923584},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4390999972820282},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4203999936580658},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.3993000090122223},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.38929998874664307},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.3824999928474426}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6225000023841858},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6123999953269958},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6007999777793884},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5681999921798706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5616999864578247},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45410001277923584},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4390999972820282},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4203999936580658},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.3993000090122223},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38929998874664307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38679999113082886},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3824999928474426},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3756999969482422},{"id":"https://openalex.org/C51152595","wikidata":"https://www.wikidata.org/wiki/Q7882501","display_name":"Uncertainty theory","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.3206999897956848},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.3075000047683716},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29589998722076416},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.2935999929904938},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.2865000069141388},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C176147448","wikidata":"https://www.wikidata.org/wiki/Q1889114","display_name":"Sensitivity analysis","level":3,"score":0.2757999897003174},{"id":"https://openalex.org/C84839998","wikidata":"https://www.wikidata.org/wiki/Q5249245","display_name":"Decision rule","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2667999863624573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.07459","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07459","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.07459","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07459","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.8269873857498169,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"basic":[1],"model":[2,52],"in":[3,23,86],"sequential":[4,89],"decision":[5,10,90],"making":[6],"is":[7,14,81,127],"the":[8,29,34,121,146],"Markov":[9,137],"process":[11],"(MDP),":[12],"which":[13],"extended":[15],"to":[16,133],"Robust":[17,136],"MDPs":[18],"(RMDPs)":[19],"by":[20],"allowing":[21],"uncertainty":[22,35,45,102,119,156,167],"transition":[24,31],"probabilities":[25,32],"and":[26,50,67,88,154,158],"optimizing":[27],"against":[28],"worst-case":[30],"from":[33],"sets.":[36,103],"The":[37,72],"class":[38,59,80],"of":[39,60,74,135],"$(s,":[40],"a)$-rectangular":[41],"RMDPs":[42,61,126],"with":[43,62,130,152,165],"$L_p$":[44,166],"sets":[46,168],"provides":[47],"a":[48,63,68,82,96],"flexible":[49],"expressive":[51],"for":[53,78,100,116,125,150,163,169],"such":[54],"problems.":[55],"We":[56],"study":[57],"this":[58,79,105],"discounted-sum":[64],"cost":[65],"criterion":[66],"constant":[69],"discount":[70],"factor.":[71],"existence":[73],"an":[75],"efficient":[76],"algorithm":[77,99,124,149],"fundamental":[83],"theoretical":[84],"question":[85],"optimization":[87],"making.":[91],"Previous":[92],"results":[93,109,162],"only":[94],"establish":[95,160],"strongly":[97,128,142],"polynomial-time":[98,143],"$L_\\infty$":[101,155],"In":[104],"work,":[106],"our":[107],"main":[108],"are":[110],"as":[111],"follows:":[112],"(a)~we":[113],"show":[114],"that":[115],"any":[117],"compact":[118],"set,":[120],"policy":[122,147],"iteration":[123,148],"polynomial":[129],"oracle":[131],"access":[132],"solutions":[134],"chains":[138],"(RMCs);":[139],"(b)~we":[140],"present":[141],"bounds":[144],"on":[145],"RMCs":[151,164],"$L_1$":[153],"sets;":[157],"(c)~we":[159],"hardness":[161],"integer":[170],"$p$":[171],"satisfying":[172],"$1":[173]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-12T00:00:00"}