SearcharxivSearch

arXiv · 2602.14842

Convergence for linear quadratic potential mean field games

Abstract

This paper studies the limits of empirical means of open-loop Nash equilibria of linear-quadratic stochastic differential games as the number of players goes to infinity, when the corresponding mean field game is of potential type and may have multiple equilibria. Via weak compactness arguments, the limit points are characterized as optimal trajectories of the related deterministic control problem, thus ruling out some of the mean field equilibria. Our result is obtained by first connecting the finite player game to a suitable control problem, whose optimal trajectories are the empirical means of Nash equilibria of the game, and in which the number of players $N$ becomes a parameter. True convergence to the unique minimizer of the limit control problem then holds for almost every initial mean. In cases of multiple optimizers, we focus on examples to show that some symmetry of the data ensures that the sequence admits a random limit which is distributes uniformly among the minimizers of the potential. Multidimensional examples of the convergence result appear here for the first time, which show the flexibility of our method. We also establish a similar convergence results for the corresponding linear-quadratic potential mean field games with common noise, as the noise vanishes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alekos Cecchin, Jodi Dianetti. 2026-02-16. Convergence for linear quadratic potential mean field games. https://arxiv.org/abs/2602.14842

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