SearcharxivSearch

arXiv · 1912.10134

An optimal stopping problem for spectrally negative Markov additive processes

Abstract

Previous authors have considered optimal stopping problems driven by the running maximum of a spectrally negative L\'evy process $X$, as well as of a one-dimensional diffusion. Many of the aforementioned results are either implicitly or explicitly dependent on Peskir's maximality principle. In this article, we are interested in understanding how some of the main ideas from these previous works can be brought into the setting of problems driven by the maximum of a class of Markov additive processes (more precisely Markov modulated L\'evy processes). Similarly to previous works in the L\'evy setting, the optimal stopping boundary is characterised by a system of ordinary first-order differential equations, one for each state of the modulating component of the Markov additive process. Moreover, whereas scale functions played an important role in the previously mentioned work, we work instead with scale matrices for Markov additive processes here. We exemplify our calculations in the setting of the Shepp-Shiryaev optimal stopping problem, as well as a family of capped maximum optimal stopping problems.

Explore related subjects

Keep this discovery

BibTeXRIS

Mine Caglar, Andreas E. Kyprianou, Ceren Vardar-Acar. 2019-12-20. An optimal stopping problem for spectrally negative Markov additive processes. https://arxiv.org/abs/1912.10134

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR