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

2021/10/06 by Laurière, Mathieu, Song, Jiahao, Tang, Qing · 4 citations
#35Q91 #49D10 #49N70 #91A13 #FOS: Mathematics #Numerical Analysis (math.NA) #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.2110.02552

Abstract

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.

Cited by

• A uniqueness result for finite-state mean field games with non-separable Hamiltonian
• High order Tensor-Train-Based Schemes for High-Dimensional Mean Field Games
• Beyond separability: convergence rate of vanishing viscosity approximations to mean field games via FBSDE stability
• Gaussian process policy iteration with additive Schwarz acceleration for forward and inverse HJB and mean field game problems

Related

• A policy iteration method for Mean Field Games
• On the quadratic convergence of Newton's method for Mean Field Games with non-separable Hamiltonian
• Rates of convergence for the policy iteration method for Mean Field Games systems
• Learning optimal policies in potential Mean Field Games: Smoothed Policy Iteration algorithms
• A semi-discrete approximation for first-order stationary mean field games