Deep Learning for Mean Field Games with non-separable Hamiltonians
arXiv:2301.02877 · doi:10.1016/j.chaos.2023.113802
Abstract
This paper introduces a new method based on Deep Galerkin Methods (DGMs) for solving high-dimensional stochastic Mean Field Games (MFGs). We achieve this by using two neural networks to approximate the unknown solutions of the MFG system and forward-backward conditions. Our method is efficient, even with a small number of iterations, and is capable of handling up to 300 dimensions with a single layer, which makes it faster than other approaches. In contrast, methods based on Generative Adversarial Networks (GANs) cannot solve MFGs with non-separable Hamiltonians. We demonstrate the effectiveness of our approach by applying it to a traffic flow problem, which was previously solved using the Newton iteration method only in the deterministic case. We compare the results of our method to analytical solutions and previous approaches, showing its efficiency. We also prove the convergence of our neural network approximation with a single hidden layer using the universal approximation theorem.
References in corpus (8)
- DGM: A deep learning algorithm for solving partial differential equations
- Deep Generative Image Models using a Laplacian Pyramid of Adversarial Networks
- Physics Informed Deep Learning (Part I): Data-driven Solutions of Nonlinear Partial Differential Equations
- Deep Hidden Physics Models: Deep Learning of Nonlinear Partial Differential Equations
- A Game-Theoretic Framework for Autonomous Vehicles Velocity Control: Bridging Microscopic Differential Games and Macroscopic Mean Field Games
- The variational structure and time-periodic solutions for mean-field games systems
- A mean-field game approach to price formation in electricity markets
- Policy iteration method for time-dependent Mean Field Games systems with non-separable Hamiltonians