General optimal stopping with linear cost

From MaRDI portal
Publication:5085243

DOI10.1080/07474946.2022.2043047zbMATH Open1495.60030arXiv2001.09470OpenAlexW4280650711MaRDI QIDQ5085243FDOQ5085243


Authors:


Publication date: 27 June 2022

Published in: Sequential Analysis (Search for Journal in Brave)

Abstract: This article treats both discrete time and continuous time stopping problems for general Markov processes on the real line with general linear costs. Using an auxiliary function of maximum representation type, conditions are given to guarantee the optimal stopping time to be of threshold type. The optimal threshold is then characterized as the root of that function. For random walks our results condense in the fact that all combinations of concave increasing pay-off functions and convex cost functions lead to a one-sided solution. For L'evy processes an explicit way to obtain the auxiliary function and the threshold is given by use of the ladder height processes. Lastly, the connection from discrete and continuous problem and possible approximation of the latter one via the former one is discussed.


Full work available at URL: https://arxiv.org/abs/2001.09470




Recommendations




Cites Work


Cited In (6)





This page was built for publication: General optimal stopping with linear cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085243)