2000 character limit reached
A capped optimal stopping problem for the maximum process
Published 13 Apr 2012 in math.PR and math.OC | (1204.3119v1)
Abstract: This paper concerns an optimal stopping problem driven by the running maximum of a spectrally negative Levy process X. More precisely, we are interested in capped versions of the American lookback optimal stopping problem, which has its origins in mathematical finance, and provide semi-explicit solutions in terms of scale functions. The optimal stopping boundary is characterised by an ordinary first-order differential equation involving scale functions and, in particular, changes according to the path variation of X. Furthermore, we will link these capped problems to Peskir's maximality principle.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.