Policy iteration method for time-dependent Mean Field Games systems with non-separable Hamiltonians

10/06/2021
by   Mathieu Laurière, et al.
0

We introduce two algorithms based on a policy iteration method to numerically solve time-dependent Mean Field Game systems of partial differential equations with non-separable Hamiltonians. We prove the convergence of such algorithms in sufficiently small time intervals with Banach fixed point method. Moreover, we prove that the convergence rates are linear. We illustrate our theoretical results by numerical examples, and we discuss the performance of the proposed algorithms.

READ FULL TEXT

page 27

page 29

research
07/13/2019

Convergence Analysis of Machine Learning Algorithms for the Numerical Solution of Mean Field Control and Games: I -- The Ergodic Case

We propose two algorithms for the solution of the optimal control of erg...
research
12/31/2019

Fitted Q-Learning in Mean-field Games

In the literature, existence of equilibria for discrete-time mean field ...
research
06/22/2023

Finite element approximation of time-dependent Mean Field Games with non-differentiable Hamiltonians

The standard formulation of the PDE system of Mean Field Games (MFG) req...
research
01/07/2023

Deep Learning for Mean Field Games with non-separable Hamiltonians

This paper introduces a new method based on Deep Galerkin Methods (DGMs)...
research
10/10/2019

Lanczos-like algorithm for the time-ordered exponential: The ∗-inverse problem

The time-ordered exponential of a time-dependent matrix A(t) is defined ...
research
12/10/2021

Numerical methods for Mean field Games based on Gaussian Processes and Fourier Features

In this article, we propose two numerical methods, the Gaussian Process ...
research
03/09/2023

Blackwell's Approachability with Time-Dependent Outcome Functions and Dot Products. Application to the Big Match

Blackwell's approachability is a very general sequential decision framew...

Please sign up or login with your details

Forgot password? Click here to reset