{"id":"https://openalex.org/W7162332191","doi":"https://doi.org/10.48550/arxiv.2605.22965","title":"Performance Bounds for Rollout Policies in Stochastic Shortest Path Problems","display_name":"Performance Bounds for Rollout Policies in Stochastic Shortest Path Problems","publication_year":2026,"publication_date":"2026-05-21","ids":{"openalex":"https://openalex.org/W7162332191","doi":"https://doi.org/10.48550/arxiv.2605.22965"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.22965","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.22965","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":null,"license_id":null,"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.22965","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136934948","display_name":"Anders Hansson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hansson, Anders","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136917265","display_name":"Bo Wahlberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wahlberg, 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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.3675000071525574,"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.3675000071525574,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.13050000369548798,"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/T13553","display_name":"Age of Information Optimization","score":0.0982000008225441,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6049000024795532},{"id":"https://openalex.org/keywords/transient","display_name":"Transient (computer programming)","score":0.5784000158309937},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.5676000118255615},{"id":"https://openalex.org/keywords/terminal-value","display_name":"Terminal value","score":0.5393000245094299},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5392000079154968},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.46459999680519104},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4611999988555908},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.448199987411499}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6049000024795532},{"id":"https://openalex.org/C2780799671","wikidata":"https://www.wikidata.org/wiki/Q17087362","display_name":"Transient (computer programming)","level":2,"score":0.5784000158309937},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.5676000118255615},{"id":"https://openalex.org/C47096860","wikidata":"https://www.wikidata.org/wiki/Q575542","display_name":"Terminal value","level":4,"score":0.5393000245094299},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5392000079154968},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5098999738693237},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.46459999680519104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4643999934196472},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4611999988555908},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.448199987411499},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.39410001039505005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3702000081539154},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.35740000009536743},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.34950000047683716},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.32820001244544983},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.30059999227523804},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29100000858306885},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.26019999384880066},{"id":"https://openalex.org/C3020054081","wikidata":"https://www.wikidata.org/wiki/Q1093521","display_name":"Path dependent","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.22965","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.22965","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.22965","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.22965","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,91],"paper":[1,92],"concerns":[2],"rollout":[3,6,29,56,138],"and":[4,48,109,126,132],"certainty-equivalent":[5,137],"policies":[7],"for":[8,26,53],"stochastic":[9],"shortest":[10],"path":[11],"problems":[12],"with":[13],"absorbing":[14],"terminal":[15,63],"states.":[16],"The":[17],"main":[18],"result":[19],"provides":[20],"a":[21,27,79,95,110,141],"direct":[22],"non-asymptotic":[23],"performance":[24],"certificate":[25],"fixed":[28],"policy:":[30],"the":[31,35,41,45,50,55,62,67,71,76,105,116,134],"loss":[32],"relative":[33],"to":[34,136],"optimal":[36],"value":[37,46],"is":[38,101,119],"controlled":[39],"by":[40,49,139],"uniform":[42,124],"accuracy":[43],"of":[44,78],"approximation":[47],"expected":[51,72],"time":[52,74],"which":[54],"closed":[57],"loop":[58],"remains":[59],"away":[60],"from":[61],"state.":[64],"Thus,":[65],"in":[66,84],"undiscounted":[68],"transient":[69,106],"setting,":[70],"hitting":[73],"plays":[75],"role":[77],"discount":[80],"or":[81],"finite-horizon":[82],"parameter":[83],"more":[85],"standard":[86],"approximate":[87],"dynamic":[88],"programming":[89],"bounds.":[90],"also":[93],"gives":[94],"performance-difference":[96],"identity":[97],"showing":[98,114],"that":[99,115],"suboptimality":[100],"exactly":[102],"accumulated":[103],"through":[104],"occupation":[107],"measure,":[108],"deterministic":[111],"sharpness":[112],"example":[113],"hitting-time":[117,125],"factor":[118],"unavoidable.":[120],"Finally,":[121],"consequences":[122],"under":[123],"Foster-Lyapunov":[127],"drift":[128],"conditions":[129],"are":[130],"given,":[131],"extend":[133],"argument":[135],"adding":[140],"separate":[142],"local":[143],"model-mismatch":[144],"term.":[145]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-26T00:00:00"}