A Simple Multiscale Method for Mean Field Games

07/09/2020
by   Haoya Li, et al.
0

This paper proposes a multiscale method for solving the numerical solution of mean field games. Starting from an approximate solution at the coarsest level, the method constructs approximations on successively finer grids via alternating sweeping. At each level, numerical relaxation is used to stabilize the iterative process, and computing the initial guess by interpolating from the previous level accelerates the convergence. A second-order discretization scheme is derived for higher order convergence. Numerical examples are provided to demonstrate the efficiency of the proposed method.

READ FULL TEXT

page 10

page 13

page 14

page 16

research
03/27/2023

A Lagrange-Galerkin scheme for first order mean field games systems

In this work, we consider a first order mean field games system with non...
research
04/30/2021

On Numerical approximations of fractional and nonlocal Mean Field Games

We construct numerical approximations for Mean Field Games with fraction...
research
06/26/2023

Convexification Numerical Method for the Retrospective Problem of Mean Field Games

The convexification numerical method with the rigorously established glo...
research
12/15/2022

Error estimates of a theta-scheme for second-order mean field games

We introduce and analyze a new finite-difference scheme, relying on the ...
research
04/15/2022

A Fictitious-play Finite-difference Method for Linearly Solvable Mean Field Games

A new numerical method for mean field games (MFGs) is proposed. The targ...
research
07/02/2021

Exploration noise for learning linear-quadratic mean field games

The goal of this paper is to demonstrate that common noise may serve as ...
research
02/16/2023

A mirror descent approach for Mean Field Control applied to Demande-Side management

We consider a finite-horizon Mean Field Control problem for Markovian mo...

Please sign up or login with your details

Forgot password? Click here to reset