pith. sign in

arxiv: 1707.09090 · v1 · pith:ZGUHVHJ6new · submitted 2017-07-28 · 🧮 math.PR

Asymptotic Analysis of Mean Field Games with Small Common Noise

classification 🧮 math.PR
keywords commonnoisestrategygameordersolutionapproximateapproximation
0
0 comments X
read the original abstract

In this paper, we consider a mean field game (MFG) model perturbed by small common noise. Our goal is to give an approximation of the Nash equilibrium strategy of this game using a solution from the original no common noise MFG whose solution can be obtained through a coupled system of partial differential equations. We characterize the first order approximation via linear mean-field forward-backward stochastic differential equations whose solution is a centered Gaussian process with respect to the common noise. The first order approximate strategy can be described as follows: at time $t \in [0,T]$, applying the original MFG optimal strategy for a sub game over $[t,T]$ with the initial being the current state and distribution. We then show that this strategy gives an approximate Nash equilibrium of order $\epsilon^2$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.