SearcharxivSearch

arXiv · 2311.11098

Optimal Stopping with Randomly Arriving Stopping Opportunities

Abstract

We develop simulation-based methods to solve general optimal stopping problems with opportunities to stop that arrive randomly. Such problems occur naturally in a wide variety of applications with market frictions, such as limited liquidity, incomplete information and transaction costs. Our approach employs random time scales to map the original problem to an integer-time stopping problem with (possibly) infinite horizon. We introduce an infinite-horizon policy iteration algorithm to generate lower-biased estimates of the value function and establish a martingale dual representation to generate upper-biased estimates. Furthermore, we extend a family of backward dynamic programming methods that includes least-squares Monte Carlo. We illustrate the performance of our methods, their general applicability and the managerial implications of randomly arriving opportunities to stop in three examples: a stopped jump-diffusion that can be analyzed in closed form, a random-exercise version of a multi-dimensional max-call contract, and a real options problem in an illiquid market.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Josha A. Dekker, Roger J. A. Laeven, John G. M. Schoenmakers, Michel H. Vellekoop. 2023-11-18. Optimal Stopping with Randomly Arriving Stopping Opportunities. https://arxiv.org/abs/2311.11098

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