SearcharxivSearch

arXiv · 1912.07843

Optimal Multiple Stopping Problems under g-expectation

Abstract

In this paper, we study the optimal multiple stopping problem under Knightian uncertainty both under discrete-time case and continuous-time case. The Knightian uncertainty is modeled by a single real-valued function g, which is the generator of a kind of backward stochastic differential equations (BSDEs). We show that the value function of the multiple stopping problem coincides with the one corresponding to a new reward sequence or process. For the discrete-time case, this problem can be solved by an induction method which is a straightforward generalization of the single stopping theory. For the continuous-time case, we furthermore need to establish the continuity of the new reward family. This result can be applied to the pricing problem for swing options in financial markets, which give the holder of this contract at least two times rights to exercise it.

Explore related subjects

Keep this discovery

BibTeXRIS

Hanwu Li. 2019-12-17. Optimal Multiple Stopping Problems under g-expectation. https://arxiv.org/abs/1912.07843

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