SearcharxivSearch

arXiv · 2607.21062

A new probabilistic approach for mean field games of optimal stopping

Abstract

We propose a novel probabilistic formulation for optimal stopping mean field games (OS-MFGs) with randomized strategies. We characterize mean field equilibria through a new class of coupled forward-backward systems, termed coupled reflected forward-backward McKean--Vlasov stochastic differential equations (MKV-RFBSDEs). An equilibrium is represented by a quintuple $(X,Y,Z,A,L)$, where $L$ is an adapted, $[0,1]$-valued, non-increasing c\`adl\`ag process representing the randomized stopping strategy. The optimality of randomized stopping strategies is characterized through two novel Skorokhod-type conditions involving $L$. This characterization is new even for classical optimal stopping problems without mean field interactions. We rigorously prove an equivalence between solutions of the MKV-RFBSDE system and OS-MFG equilibria in randomized strategies. We establish the existence of equilibria by applying the Kakutani--Fan--Glicksberg fixed-point theorem to a set-valued best-response correspondence, relying on new stability, compactness, and continuity results for the coupled MKV-RFBSDE system. We also prove uniqueness under suitable conditions. Under alternative monotonicity assumptions, we develop a new order-theoretic approach based on Tarski's fixed-point theorem, yielding the existence of extremal equilibria and constructive schemes for the minimal and maximal solutions. We further show that a mean field equilibrium induces an approximate Nash equilibrium for the associated $N$-player stopping game. Finally, we connect our probabilistic formulation with the analytical approach characterized by a coupled system of constrained partial differential equations.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrea Cosso, Laura D'Andolfi, Roxana Dumitrescu. 2026-07-23. A new probabilistic approach for mean field games of optimal stopping. https://arxiv.org/abs/2607.21062

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