SearcharxivSearch

arXiv · 1210.5771

Control of McKean-Vlasov Dynamics versus Mean Field Games

Abstract

We discuss and compare two methods of investigations for the asymptotic regime of stochastic differential games with a finite number of players as the number of players tends to the infinity. These two methods differ in the order in which optimization and passage to the limit are performed. When optimizing first, the asymptotic problem is usually referred to as a mean-field game. Otherwise, it reads as an optimization problem over controlled dynamics of McKean-Vlasov type. Both problems lead to the analysis of forward-backward stochastic differential equations, the coefficients of which depend on the marginal distributions of the solutions. We explain the difference between the nature and solutions to the two approaches by investigating the corresponding forward-backward systems. General results are stated and specific examples are treated, especially when cost functionals are of linear-quadratic type.

Explore related subjects

Keep this discovery

BibTeXRIS

Rene Carmona, Francois Delarue, Aime Lachapelle. 2012-10-21. Control of McKean-Vlasov Dynamics versus Mean Field Games. https://arxiv.org/abs/1210.5771

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