Gapeev, Pavel V. ORCID: 0000-0002-1346-2074, Kort, Peter M., Lavrutich, Maria N. and Thijssen, Jacco J. J. (2022) Optimal double stopping problems for maxima and minima of geometric Brownian motions. Methodology and Computing in Applied Probability, 24 (2). 789 - 813. ISSN 1387-5841
Text (Gapeev_optimal-double-stopping-problems--published)
- Published Version
Available under License Creative Commons Attribution. Download (3MB) |
Abstract
We present closed-form solutions to some double optimal stopping problems with payoffs representing linear functions of the running maxima and minima of a geometric Brownian motion. It is shown that the optimal stopping times are th first times at which the underlying process reaches some lower or upper stochastic boundaries depending on the current values of its running maximum or minimum. The proof is based on the reduction of the original double optimal stopping problems to sequences of single optimal stopping problems for the resulting three-dimensional continuous Markov process. The latter problems are solved as the equivalent free-boundary problems by means of the smooth-fit and normal-reflection conditions for the value functions at the optimal stopping boundaries and the edges of the three-dimensional state space. We show that the optimal stopping boundaries are determined as the extremal solutions of the associated first-order nonlinear ordinary differential equations. The obtained results are related to the valuation of perpetual real double lookback options with floating sunk costs in the Black-Merton-Scholes model.
Item Type: | Article |
---|---|
Official URL: | https://www.springer.com/journal/11009 |
Additional Information: | © 2022 The Authors |
Divisions: | Mathematics |
Subjects: | Q Science > QA Mathematics |
JEL classification: | G - Financial Economics > G1 - General Financial Markets > G13 - Contingent Pricing; Futures Pricing |
Date Deposited: | 11 Apr 2022 10:39 |
Last Modified: | 12 Dec 2024 02:57 |
URI: | http://eprints.lse.ac.uk/id/eprint/114849 |
Actions (login required)
View Item |