Search arXivSearch

arXiv · 2402.01639

A Control Theoretical Approach to Mean Field Games and Associated Master Equations

Abstract

We prove the global-in-time well-posedness for a broad class of mean field game problems, which is beyond the special linear-quadratic setting, as long as the mean field sensitivity is not too large. Through the stochastic maximum principle, we adopt the FBSDE approach to investigate the unique existence of the corresponding equilibrium strategies. The corresponding FBSDEs are first solved locally in time, then by controlling the sensitivity of the backward solutions with respect to the initial condition via some suitable apriori estimates for the corresponding Jacobian flows, the global-in-time solution is warranted. Further analysis on these Jacobian flows will be discussed to establish the regularities, such as linear functional differentiability, of the respective value functions that leads to the ultimate classical well-posedness of the master equation on $\mathbb{R}^d$. To the best of our knowledge, it is the first article to deal with the mean field game problem, as well as its associated master equation, with general cost functionals having quadratic growth under the small mean field effect. In this current approach, we directly impose the structural conditions on the cost functionals, rather than conditions on the Hamiltonian. The advantages of this are threefold: (i) compared with imposing conditions on Hamiltonian, the structural conditions imposed in this work are easily verified, and less demanding on the regularity requirements of the cost functionals while solving the master equation; (ii) the displacement monotonicity is basically just a direct consequence of small mean field effect in the structural conditions; and (iii) when the mean field effect is not that small, we can still provide an accurate lifespan for the local existence. The method in this work can be readily extended to the case with nonlinear drift and non-separable cost functionals.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alain Bensoussan, Ho Man Tai, Tak Kwong Wong, Sheung Chi Phillip Yam. 2025-01-22. A Control Theoretical Approach to Mean Field Games and Associated Master Equations. https://arxiv.org/abs/2402.01639

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Subpath-Based Column Generation for Electric Vehicle Routing Problems

Motivated by widespread electrification targets, this paper studies an Electric Vehicle Routing Problem with Time Windows and Nonlinear Charging (EVRPTWNL) that jointly optimizes routing-scheduling decisions and charging decisions given vehicle capacities, time windows and battery capacities. We develop a column generation scheme with a subpath-based label-setting algorithm that decomposes the pricing problem into two phases: (i) generating subpaths between charging stations, and (ii) combining subpaths into paths while optimizing charging decisions in between. We formalize a domination framework to establish the convergence and exactness of the algorithm, and prove that the methodology can solve a range of EVRP variants (e.g., with vehicle capacities, time windows, and nonlinear charging) and relaxation-tightening strategies (e.g., ng-relaxations and subset-row cuts). Computational results show improvements over path-based benchmarks in both computational time and solution quality, especially when time windows become wider, when vehicles can perform multiple tasks on a single charge and when vehicles still need to recharge several times across the planning horizon. Ultimately, the methodology can scale to otherwise intractable instances with up to 100 customers, thereby enhancing fleet management capabilities across electrified logistics areas.

math.OC

Polynomial Scaling is Possible For Neural Operator Approximations of Structured Families of BSDEs

Neural operator (NO) architectures learn nonlinear maps between infinite-dimensional function spaces and are widely used to accelerate simulation and enable data-driven model discovery. While universality results ensure expressivity, they do not address \emph{complexity}: for broad operator classes described only through regularity (e.g.\ uniform continuity or $C^r$-regularity), information-theoretic lower bounds imply that minimax-optimal NO approximation rates scale \emph{exponentially} in the reciprocal accuracy $1/\varepsilon$. This has shifted the focus of NO theory toward identifying additional problem-specific structure, beyond regularity, under which suitably tailored NO architectures can leverage to unlock polynomial scaling in $1/\varepsilon$. We exhibit the first polynomial-scaling regime for NO approximations of solution operators in stochastic analysis; by identifying structured families of \emph{non-Markovian} BSDEs with randomized terminal condition parameterized by the Sobolev-regular terminal condition and by Sobolev-regular additive nonlinear perturbations of the generator. We prove that their solution operator can be approximated (uniformly over the family) by a tailored NO whose number of trainable parameters grows \emph{polynomially} in $1/\varepsilon$. We unlock this polynomial scaling regime by \emph{informing the NO's inductive bias} by factoring out the singular part of the associated semilinear elliptic PDE Green's function and by incorporating the Doléans--Dade exponential of the BSDE's common non-Markovian factor into the NO's decoding layers. As a byproduct, we extend polynomial-scaling guarantees from families of linear elliptic PDEs on regular domains to the semilinear setting.

math.OC

The Competive Spectral Radius of Families of Nonexpansive Mappings

We consider a new class of repeated zero-sum games in which the payoff is the escape rate of a switched dynamical system, where at every stage, the transition is given by a nonexpansive operator depending on the actions of both players. This generalizes to the two-player (and non-linear) case the notion of joint spectral radius of a family of matrices. We show that the value of this game does exist, and we characterize it in terms of an infinite dimensional non-linear eigenproblem. This provides a two-player analogue of Mañe's lemma from ergodic control. This also extends to the two-player case results of Kohlberg and Neyman (1981), Karlsson (2001), and Vigeral and the second author (2012), concerning the asymptotic behavior of nonexpansive mappings. We discuss two special cases of this game: order preserving and positively homogeneous self-maps of a cone equipped with Funk's and Thompson's metrics, and translations of a finite dimensional normed space.

math.OC