SearcharxivSearch

arXiv · 2310.00407

On the limit theory of mean field optimal stopping with non-Markov dynamics and common noise

Abstract

This paper focuses on a mean-field optimal stopping problem with non-Markov dynamics and common noise, inspired by Talbi, Touzi, and Zhang \cite{TalbiTouziZhang1,TalbiTouziZhang3}. The goal is to establish the limit theory and demonstrate the equivalence of the value functions between weak and strong formulations. The difference between the strong and weak formulations lies in the source of randomness determining the stopping time on a canonical space. In the strong formulation, the randomness of the stopping time originates from Brownian motions. In contrast, this may not necessarily be the case in the weak formulation. Additionally, a $(H)$-Hypothesis-type condition is introduced to guarantee the equivalence of the value functions. The limit theory encompasses the convergence of the value functions and solutions of the large population optimal stopping problem towards those of the mean-field limit, and it shows that every solution of the mean field optimal stopping problem can be approximated by solutions of the large population optimal stopping problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Xihao He. 2023-09-30. On the limit theory of mean field optimal stopping with non-Markov dynamics and common noise. https://arxiv.org/abs/2310.00407

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