Hostname: page-component-77f85d65b8-t6st2 Total loading time: 0 Render date: 2026-04-18T18:15:09.351Z Has data issue: false hasContentIssue false

Discounted optimal stopping zero-sum games in diffusion type models with maxima and minima

Published online by Cambridge University Press:  03 December 2024

Pavel V. Gapeev*
Affiliation:
London School of Economics and Political Science
*
*Postal address: London School of Economics, Department of Mathematics, Houghton Street, London WC2A 2AE, United Kingdom. Email address: p.v.gapeev@lse.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

We present a closed-form solution to a discounted optimal stopping zero-sum game in a model based on a generalised geometric Brownian motion with coefficients depending on its running maximum and minimum processes. The optimal stopping times forming a Nash equilibrium are shown to be the first times at which the original process hits certain boundaries depending on the running values of the associated maximum and minimum processes. The proof is based on the reduction of the original game to the equivalent coupled free-boundary problem and the solution of the latter problem by means of the smooth-fit and normal-reflection conditions. We show that the optimal stopping boundaries are partially determined as either unique solutions to the appropriate system of arithmetic equations or unique solutions to the appropriate first-order nonlinear ordinary differential equations. The results obtained are related to the valuation of the perpetual lookback game options with floating strikes in the appropriate diffusion-type extension of the Black–Merton–Scholes model.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. A computer drawing of the optimal exercise boundaries $a_*(s, q)$, $b_*(s, q)$, and ${\underline a}(s, q)$, for each $q > 0$ fixed.

Figure 1

Figure 2. A computer drawing of the optimal exercise boundaries $a_*(s, q)$, $b_*(s, q)$, and ${\overline b}(s, q)$, for each $s > 0$ fixed.

Figure 2

Figure 3. A computer drawing of the boundary functions $b_1(a)$ and $b_2(a)$ in the case $a^{\prime}(s, q) \le a_*(s, q) < b_*(s, q) \le b^{\prime}(s, q)$, for each $0 < q < s$ fixed.

Figure 3

Figure 4. A computer drawing of the value function $V_*(x, s, q)$ and optimal exercise boundaries $a^{\prime}(s, q) < a_*(s, q) < b_*(s, q) < b^{\prime}(s, q)$, for each $0 < q < s$ fixed.

Figure 4

Figure 5. A computer drawing of the value function $V_*(x, s, q)$ and optimal exercise boundaries $a^{\prime}(s, q) = a_*(s, q) < b_*(s, q) < b^{\prime}(s, q)$, for each $0 < q < s$ fixed.

Figure 5

Figure 6. A computer drawing of the value function $V_*(x, s, q)$ and optimal exercise boundaries $a^{\prime}(s, q) < a_*(s, q) < b_*(s, q) = b^{\prime}(s, q)$, for each $0 < q < s$ fixed.