{"id":"https://openalex.org/W4415791071","doi":"https://doi.org/10.1017/jpr.2025.10033","title":"A sequential stopping problem with costly reversibility","display_name":"A sequential stopping problem with costly reversibility","publication_year":2025,"publication_date":"2025-11-03","ids":{"openalex":"https://openalex.org/W4415791071","doi":"https://doi.org/10.1017/jpr.2025.10033"},"language":"en","primary_location":{"id":"doi:10.1017/jpr.2025.10033","is_oa":true,"landing_page_url":"https://doi.org/10.1017/jpr.2025.10033","pdf_url":null,"source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1017/jpr.2025.10033","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074357271","display_name":"Jukka Lempa","orcid":null},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Jukka Lempa","raw_affiliation_strings":["University of Turku"],"affiliations":[{"raw_affiliation_string":"University of Turku","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085878811","display_name":"Harto Saarinen","orcid":"https://orcid.org/0000-0002-5053-9990"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Harto Saarinen","raw_affiliation_strings":["University of Turku"],"affiliations":[{"raw_affiliation_string":"University of Turku","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120229352","display_name":"Tarmo Taipale","orcid":null},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Tarmo Taipale","raw_affiliation_strings":["University of Turku"],"affiliations":[{"raw_affiliation_string":"University of Turku","institution_ids":["https://openalex.org/I155660961"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074357271"],"corresponding_institution_ids":["https://openalex.org/I155660961"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36927054,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"63","issue":"1","first_page":"225","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.31029999256134033,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.31029999256134033,"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"}},{"id":"https://openalex.org/T10067","display_name":"Stochastic processes and financial applications","score":0.2897000014781952,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.07760000228881836,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.8823000192642212},{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.7400000095367432},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.6915000081062317},{"id":"https://openalex.org/keywords/optional-stopping-theorem","display_name":"Optional stopping theorem","score":0.6747000217437744},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6525999903678894},{"id":"https://openalex.org/keywords/stopping-time","display_name":"Stopping time","score":0.6305000185966492},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5333999991416931},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4514000117778778},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43950000405311584},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.439300000667572}],"concepts":[{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.8823000192642212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.769599974155426},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.7400000095367432},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.6915000081062317},{"id":"https://openalex.org/C52832964","wikidata":"https://www.wikidata.org/wiki/Q2027347","display_name":"Optional stopping theorem","level":3,"score":0.6747000217437744},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6525999903678894},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.633899986743927},{"id":"https://openalex.org/C99888217","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping time","level":2,"score":0.6305000185966492},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5333999991416931},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4514000117778778},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43950000405311584},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.439300000667572},{"id":"https://openalex.org/C150325174","wikidata":"https://www.wikidata.org/wiki/Q4335500","display_name":"Optimal decision","level":3,"score":0.4154999852180481},{"id":"https://openalex.org/C28901747","wikidata":"https://www.wikidata.org/wiki/Q177571","display_name":"Decision theory","level":2,"score":0.4018999934196472},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3765999972820282},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3723999857902527},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.3619999885559082},{"id":"https://openalex.org/C86426650","wikidata":"https://www.wikidata.org/wiki/Q7452504","display_name":"Sequential estimation","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.3463999927043915},{"id":"https://openalex.org/C2986080485","wikidata":"https://www.wikidata.org/wiki/Q1331926","display_name":"Decision maker","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.34369999170303345},{"id":"https://openalex.org/C61449625","wikidata":"https://www.wikidata.org/wiki/Q4683801","display_name":"Admissible decision rule","level":5,"score":0.34200000762939453},{"id":"https://openalex.org/C75438885","wikidata":"https://www.wikidata.org/wiki/Q3403615","display_name":"Large deviations theory","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C2983961125","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping rule","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C84839998","wikidata":"https://www.wikidata.org/wiki/Q5249245","display_name":"Decision rule","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C88757350","wikidata":"https://www.wikidata.org/wiki/Q1557613","display_name":"L\u00e9vy process","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C80478641","wikidata":"https://www.wikidata.org/wiki/Q195771","display_name":"Sequential analysis","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.26820001006126404},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.26409998536109924},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.2574000060558319},{"id":"https://openalex.org/C163540672","wikidata":"https://www.wikidata.org/wiki/Q1115431","display_name":"Markov renewal process","level":5,"score":0.2572999894618988}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/jpr.2025.10033","is_oa":true,"landing_page_url":"https://doi.org/10.1017/jpr.2025.10033","pdf_url":null,"source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"},{"id":"pmh:oai:www.utupub.fi:10024/195838","is_oa":true,"landing_page_url":"https://www.cambridge.org/core/journals/journal-of-applied-probability/article/sequential-stopping-problem-with-costly-reversibility/2EE4DD82CD3CDD8CDA0C9CA91C67CFD6","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1017/jpr.2025.10033","is_oa":true,"landing_page_url":"https://doi.org/10.1017/jpr.2025.10033","pdf_url":null,"source":{"id":"https://openalex.org/S160779208","display_name":"Journal of Applied Probability","issn_l":"0021-9002","issn":["0021-9002","1475-6072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Probability","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310041","display_name":"Foundation for Economic Education","ror":"https://ror.org/05323zs40"},{"id":"https://openalex.org/F4320325228","display_name":"Liikesivistysrahasto","ror":"https://ror.org/03jbt3445"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1981917409","https://openalex.org/W1986374674","https://openalex.org/W1997826741","https://openalex.org/W2007865084","https://openalex.org/W2014523542","https://openalex.org/W2044803601","https://openalex.org/W2072750279","https://openalex.org/W2098521893","https://openalex.org/W2152092364","https://openalex.org/W2225274380","https://openalex.org/W2345373490","https://openalex.org/W2885953336","https://openalex.org/W2890465795","https://openalex.org/W3000186248","https://openalex.org/W3121839435","https://openalex.org/W3125791851","https://openalex.org/W3201922414","https://openalex.org/W4226329517","https://openalex.org/W4283580151","https://openalex.org/W4328117176","https://openalex.org/W4389038595","https://openalex.org/W4392140737"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1,61,85],"study":[2],"sequential":[3],"optimal":[4,10,101],"stopping":[5,11,26,45],"with":[6],"partial":[7],"reversibility.":[8],"The":[9,47],"problem":[12],"is":[13,19,28,50],"subject":[14],"to":[15,51],"implementation":[16],"delay,":[17],"which":[18],"random":[20],"and":[21,42,79,94,99],"exponentially":[22],"distributed.":[23],"Once":[24],"the":[25,30,39,44,53,58,63,88,96,100],"decision":[27,31,40,102],"made,":[29],"maker":[32],"can,":[33],"by":[34],"incurring":[35],"a":[36,69,73,105],"cost,":[37],"call":[38],"off":[41],"restart":[43],"problem.":[46],"optimization":[48],"criterion":[49],"maximize":[52],"expected":[54],"present":[55],"value":[56,64,97],"of":[57,68,76,90,108],"total":[59],"payoff.":[60],"characterize":[62,95],"function":[65,98],"in":[66],"terms":[67],"Bellman":[70],"principle":[71],"for":[72,104],"wide":[74,106],"class":[75,107],"payoff":[77,109],"functions":[78],"potentially":[80],"multidimensional":[81],"strong":[82],"Markov":[83],"dynamics.":[84],"also":[86],"analyse":[87],"case":[89],"linear":[91],"diffusion":[92],"dynamics":[93],"rule":[103],"functions.":[110]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-11-03T00:00:00"}