Table of Contents
Fetching ...

An introduction to monotonicity methods in mean-field games

Rita Ferreira, Diogo Gomes, Teruo Tada

TL;DR

Mean-field games are recast as a monotone-operator problem via an operator $F$ coupling a Hamilton–Jacobi and a Fokker–Planck equation. The authors develop a Minty-type approach and regularization strategies to produce weak solutions for both stationary and time-dependent MFGs, and they implement three constructive routes—variational, bilinear-form, and continuity method—to build regularized solutions and pass to the limit. The results hold under mild growth and monotonicity assumptions (e.g., convex $H$ and increasing $g$) and provide a unified PDE-based toolkit with potential numerical and analytical applications for planning, congestion, and large-population economics. This framework advances a robust, monotone-operator perspective on MFG existence and lays the groundwork for further extensions to non-monotone settings and dynamic planning problems.

Abstract

This chapter examines monotonicity techniques in the theory of mean-field games(MFGs). Originally, monotonicity ideas were used to establish the uniqueness of solutions for MFGs. Later, monotonicity methods and monotone operators were further exploited to build numerical methods and to construct weak solutions under mild assumptions. Here, after a brief discussion on the mean-field game formulation, we introduce the Minty method and regularization strategies for PDEs. These are then used to address typical stationary and time-dependent monotone MFGs and to establish the existence of weak solutions for such MFGs.

An introduction to monotonicity methods in mean-field games

TL;DR

Mean-field games are recast as a monotone-operator problem via an operator coupling a Hamilton–Jacobi and a Fokker–Planck equation. The authors develop a Minty-type approach and regularization strategies to produce weak solutions for both stationary and time-dependent MFGs, and they implement three constructive routes—variational, bilinear-form, and continuity method—to build regularized solutions and pass to the limit. The results hold under mild growth and monotonicity assumptions (e.g., convex and increasing ) and provide a unified PDE-based toolkit with potential numerical and analytical applications for planning, congestion, and large-population economics. This framework advances a robust, monotone-operator perspective on MFG existence and lays the groundwork for further extensions to non-monotone settings and dynamic planning problems.

Abstract

This chapter examines monotonicity techniques in the theory of mean-field games(MFGs). Originally, monotonicity ideas were used to establish the uniqueness of solutions for MFGs. Later, monotonicity methods and monotone operators were further exploited to build numerical methods and to construct weak solutions under mild assumptions. Here, after a brief discussion on the mean-field game formulation, we introduce the Minty method and regularization strategies for PDEs. These are then used to address typical stationary and time-dependent monotone MFGs and to establish the existence of weak solutions for such MFGs.

Paper Structure

This paper contains 18 sections, 25 theorems, 187 equations.

Key Result

Proposition 2.1

Consider the operator $F$ given by defF1 associated with the MFG in mp. Assume that $H$ is convex, $g$ is increasing, and let $D(F)=C^2({\mathbb{T}}^d; {\mathbb{R}}_0^+)\times C^1({\mathbb{T}}^d)$. Then, $F$ is monotone in $L^2({\mathbb{T}}^d)\times L^2({\mathbb{T}}^d)$.

Theorems & Definitions (62)

  • Proposition 2.1
  • proof
  • Remark 2.2
  • Proposition 2.3
  • proof
  • Remark 2.4
  • Proposition 3.1: Minty's method
  • proof
  • Proposition 3.2
  • proof
  • ...and 52 more