{"id":"https://openalex.org/W7136578330","doi":"https://doi.org/10.48550/arxiv.2603.12636","title":"Weakly Time-Coupled Approximation of Markov Decision Processes","display_name":"Weakly Time-Coupled Approximation of Markov Decision Processes","publication_year":2026,"publication_date":"2026-03-13","ids":{"openalex":"https://openalex.org/W7136578330","doi":"https://doi.org/10.48550/arxiv.2603.12636"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.12636","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12636","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.2603.12636","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020328383","display_name":"Negar Soheili","orcid":"https://orcid.org/0000-0002-2114-5319"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Soheili, Negar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129418444","display_name":"Selvaprabu Nadarajah","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nadarajah, Selvaprabu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5129501888","display_name":"Bo Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Bo","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/T11413","display_name":"Risk and Portfolio Optimization","score":0.2870999872684479,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.2870999872684479,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.14890000224113464,"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/T11195","display_name":"Simulation Techniques and Applications","score":0.09589999914169312,"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/markov-decision-process","display_name":"Markov decision process","score":0.5699999928474426},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.5209000110626221},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48809999227523804},{"id":"https://openalex.org/keywords/basis-function","display_name":"Basis function","score":0.45350000262260437},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44749999046325684},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.40610000491142273},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4002000093460083},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3813000023365021},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3653999865055084},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.3497999906539917}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6040999889373779},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5699999928474426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.564300000667572},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.5209000110626221},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48809999227523804},{"id":"https://openalex.org/C5917680","wikidata":"https://www.wikidata.org/wiki/Q2621825","display_name":"Basis function","level":2,"score":0.45350000262260437},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44749999046325684},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.40610000491142273},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4002000093460083},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3653999865055084},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3497999906539917},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3345000147819519},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.31380000710487366},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C186215838","wikidata":"https://www.wikidata.org/wiki/Q772232","display_name":"Conditional expectation","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28189998865127563},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2540000081062317},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.12636","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12636","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.2603.12636","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.12636","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Finite-horizon":[0],"Markov":[1],"decision":[2],"processes":[3],"(MDPs)":[4],"with":[5,36,102,240],"high-dimensional":[6],"exogenous":[7,200],"uncertainty":[8],"and":[9,15,20,24,68,83,116,146,152,217,223,234],"endogenous":[10],"states":[11],"arise":[12],"in":[13,236],"operations":[14],"finance,":[16],"including":[17],"the":[18,37,43,77,103,113,136,155,160,172,190],"valuation":[19],"exercise":[21],"of":[22,112,128,144,150,189],"Bermudan":[23,221],"real":[25],"options,":[26],"but":[27,49,73,94],"face":[28],"a":[29,118],"scalability":[30],"barrier":[31],"as":[32,159],"computational":[33,98,186],"complexity":[34,99,187],"grows":[35],"horizon.":[38,78,104,129,191],"A":[39],"common":[40],"approximation":[41,114,121],"represents":[42],"value":[44,158],"function":[45,134],"using":[46],"basis":[47,133,161,203,218],"functions,":[48],"methods":[50],"for":[51,214],"fitting":[52],"weights":[53,64,89],"treat":[54],"cross-stage":[55,124],"optimization":[56,72,85],"differently.":[57],"Least":[58],"squares":[59],"Monte":[60],"Carlo":[61],"(LSM)":[62],"fits":[63],"via":[65],"backward":[66],"recursion":[67],"regression,":[69],"avoiding":[70],"joint":[71],"accumulating":[74],"error":[75],"over":[76],"Approximate":[79],"linear":[80],"programming":[81],"(ALP)":[82],"pathwise":[84],"(PO)":[86],"jointly":[87],"fit":[88],"to":[90,100,154,171,181],"produce":[91],"upper":[92,138,230],"bounds,":[93],"temporal":[95,178],"coupling":[96,108,184],"causes":[97],"grow":[101],"We":[105,164],"show":[106],"this":[107],"is":[109,126,140],"an":[110],"artifact":[111],"architecture,":[115],"develop":[117],"weakly":[119],"time-coupled":[120],"(WTCA)":[122],"where":[123],"dependence":[125],"independent":[127,188],"For":[130],"any":[131],"fixed":[132,215],"set,":[135],"WTCA":[137,197,227],"bound":[139],"tighter":[141,208,213,229],"than":[142,148,205,232],"that":[143,149],"ALP":[145],"looser":[147],"PO,":[151,206],"converges":[153],"optimal":[156],"policy":[157],"family":[162],"expands.":[163],"extend":[165],"parallel":[166],"deterministic":[167],"block":[168],"coordinate":[169],"descent":[170],"stochastic":[173],"MDP":[174],"setting":[175],"exploiting":[176],"weak":[177,183],"coupling.":[179],"Applied":[180],"WTCA,":[182],"yields":[185],"Within":[192],"equal":[193],"time":[194],"budget,":[195],"solving":[196],"accommodates":[198],"more":[199],"samples":[201,216],"or":[202],"functions":[204],"yielding":[207],"bounds":[209,231],"despite":[210],"PO":[211,233],"being":[212],"functions.":[219],"On":[220],"option":[222],"ethanol":[224],"production":[225],"instances,":[226],"produces":[228],"LSM":[235],"every":[237],"instance":[238],"tested,":[239],"near-optimal":[241],"policies":[242],"at":[243],"longer":[244],"horizons.":[245]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-03-17T00:00:00"}