SearcharxivSearch

arXiv · 1608.04537

Timing in the Presence of Directional Predictability: Optimal Stopping of Skew Brownian Motion

Abstract

We investigate a class of optimal stopping problems arising in, for example, studies considering the timing of an irreversible investment when the underlying follows a skew Brownian motion. Our results indicate that the local directional predictability modeled by the presence of a skew point for the underlying has a nontrivial and somewhat surprising impact on the timing incentives of the decision maker. We prove that waiting is always optimal at the skew point for a large class of exercise payoffs. An interesting consequence of this finding, which is in sharp contrast with studies relying on ordinary Brownian motion, is that the exercise region for the problem can become unconnected even when the payoff is linear. We also establish that higher skewness increases the incentives to wait and postpones the optimal timing of an investment opportunity. Our general results are explicitly illustrated for a piecewise linear payoff.

Explore related subjects

Keep this discovery

BibTeXRIS

Luis H. R. Alvarez E., Paavo Salminen. 2016-08-16. Timing in the Presence of Directional Predictability: Optimal Stopping of Skew Brownian Motion. https://arxiv.org/abs/1608.04537

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