Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-07T09:28:40.498Z Has data issue: false hasContentIssue false

Optimal stopping of Gauss–Markov bridges

Published online by Cambridge University Press:  04 December 2024

Abel Azze*
Affiliation:
CUNEF Universidad
Bernardo D’Auria*
Affiliation:
University of Padua
Eduardo García-Portugués*
Affiliation:
Universidad Carlos III de Madrid
*
*Postal address: Department of Quantitative Methods, CUNEF Universidad, Spain. Email address: abel.guada@cunef.edu
**Postal address: Department of Mathematics, University of Padua, Italy. Email address: bernardo.dauria@unipd.it
***Postal address: Department of Statistics, Universidad Carlos III de Madrid, Spain. Email address: edgarcia@est-econ.uc3m.es
Rights & Permissions [Opens in a new window]

Abstract

We solve the non-discounted, finite-horizon optimal stopping problem of a Gauss–Markov bridge by using a time-space transformation approach. The associated optimal stopping boundary is proved to be Lipschitz continuous on any closed interval that excludes the horizon, and it is characterized by the unique solution of an integral equation. A Picard iteration algorithm is discussed and implemented to exemplify the numerical computation and geometry of the optimal stopping boundary for some illustrative cases.

Information

Type
Original Article
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

Figure 1. The picture shows a comparison between the exact OSB of a BB and its numerical computation, which is obtained by setting $\widetilde{\theta}\equiv 0$ and taking a constant volatility $\widetilde{\nu}$ in the OU representation (65). For the images on top, the solid colored lines represent the computed OSBs for the different choices of the volatility coefficient $\widetilde{\nu}$ (image (a)), the partition length N (image (b)), and the type of partition considered (image (c)). The black dashed, dotted, and dashed-dotted lines represent the OSB of a BB associated with the different values of $\widetilde{\nu}$. Specifications are shown in the legend and caption of each image. Image (c) accounts for a subplot that shows, as a function of the partition size N (x-axis), the evolution of the relative $L_2$ error between the various computed boundaries and the true one (y-axis). The smaller images at the bottom show the log-errors $\log_{10}(d_k)$ between consecutive boundaries for each iteration $k = 1, 2,\ldots$ of the Picard algorithm.

Figure 1

Figure 2. The first row of three plots shows $1/\widetilde{\theta}$ (continuous line) versus $1/\theta$ (dashed line) for the different choices of the slope $\widetilde{\theta}$ (image (a)), the mean-reverting level $\widetilde{\kappa}$ (image (b)), and the volatility $\widetilde{\nu}$ (image (c)). Specifications of the functions are given in the legend and caption of each image. The second row does the same for $\widetilde{\kappa}$ and $\kappa$. The main plot, in the third row, shows in solid colored lines the computed OSBs. The smaller images at the bottom display the log-errors $\log_{10}(d_k)$ between consecutive boundaries for each iteration $k = 1, 2,\ldots$ of the Picard algorithm.