SearcharxivSearch

arXiv · 2211.13918

American Options with Last Exit Times: A Free-Boundary Approach

Abstract

We study the valuation of an American put option with a random time horizon given by the last exit time of the underlying asset from a fixed level. Since this random time is not a stopping time, the problem falls outside the classical optimal stopping framework. Using enlargement of filtrations and the associated Az\'{e}ma supermartingale, we transform the problem into an equivalent optimal stopping problem with a semi-continuous, time-dependent gain function whose partial derivatives exhibit singular behaviour. The resulting formulation introduces significant analytical challenges, including the loss of smoothness of the optimal stopping boundary. We develop new arguments to characterise the continuation and stopping regions, establishing monotonicity of the free boundary under suitable conditions, and analyse the regularity of the value function. In particular, we derive nonlinear integral equations that uniquely characterise both the free-boundary and the value function. Our results extend the classical theory of American options to a class of problems with random horizons and provide a framework for incorporating default-type features modelled by last exit times.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhuoshu Wu, Libo Li. 2022-11-25. American Options with Last Exit Times: A Free-Boundary Approach. https://arxiv.org/abs/2211.13918

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