Deep Backward and Galerkin Methods for the Finite State Master Equation

TL;DR

This paper introduces two neural network-based methods for solving the master equation in finite-state mean field games, providing theoretical guarantees and numerical validation up to 15 dimensions.

Contribution

The paper develops and analyzes two neural network approaches for solving the master equation in finite-state MFGs, including theoretical approximation guarantees and numerical experiments.

Findings

Existence of neural networks with arbitrarily small loss functions.

Small loss implies neural networks approximate the master equation well.

Numerical experiments up to dimension 15 validate the methods.

Abstract

This paper proposes and analyzes two neural network methods to solve the master equation for finite-state mean field games (MFGs). Solving MFGs provides approximate Nash equilibria for stochastic, differential games with finite but large populations of agents. The master equation is a partial differential equation (PDE) whose solution characterizes MFG equilibria for any possible initial distribution. The first method we propose relies on backward induction in a time component while the second method directly tackles the PDE without discretizing time. For both approaches, we prove two types of results: there exist neural networks that make the algorithms' loss functions arbitrarily small, and conversely, if the losses are small, then the neural networks are good approximations of the master equation's solution. We conclude the paper with numerical experiments on benchmark problems from the literature up to dimension 15, and a comparison with solutions computed by a classical method for fixed initial distributions.