SearcharxivSearch

arXiv · 1409.7141

A Probabilistic Approach to Mean Field Games with Major and Minor Players

Abstract

We propose a new approach to mean field games with major and minor players. Our formulation involves a two player game where the optimization of the representative minor player is standard while the major player faces an optimization over conditional McKean-Vlasov stochastic differential equations. The definition of this limiting game is justified by proving that its solution provides approximate Nash equilibriums for large finite player games. This proof depends upon the generalization of standard results on the propagation of chaos to conditional dynamics. Because it is on independent interest, we prove this generalization in full detail. Using a conditional form of the Pontryagin stochastic maximum principle (proven in the appendix), we reduce the solution of the mean field game to a forward-backward system of stochastic differential equations of the conditional McKean-Vlasov type, which we solve in the Linear Quadratic setting. We use this class of models to show that Nash equilibriums in our formulation can be different from those of the formulations contemplated so far in the literature.

Explore related subjects

Keep this discovery

BibTeXRIS

Rene Carmona, Xiuneng Zhu. 2014-09-25. A Probabilistic Approach to Mean Field Games with Major and Minor Players. https://arxiv.org/abs/1409.7141

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