Related papers: Convexification for a Coefficient Inverse Problem …
We analyze asymptotic convergence properties of Newton's method for a class of evolutive Mean Field Games systems with non-separable Hamiltonian arising in mean field type models with congestion. We prove the well posedness of the Mean…
Mean Field Game is a rather new field initially developed in applied mathematics and engineering in order to deal with the dynamics of a large number of controlled agents or objects in interaction. For a large class of these models, there…
We propose a MFG model with quadratic Hamiltonian involving $N$ populations. This results in a system of $N$ Hamilton-Jacobi-Bellman and $N$ Fokker-Planck equations with non-local interactions. As in the classical case we introduce an…
Finite-state mean-field games (MFGs) arise as limits of large interacting particle systems and are governed by an MFG system, a coupled forward-backward differential equation consisting of a forward Kolmogorov-Fokker-Planck (KFP) equation…
The mean field games (MFG) paradigm was introduced to provide tractable approximations of games involving very large populations. The theory typically rests on two key assumptions: homogeneity, meaning that all players share the same…
Two main aims of this paper are to develop a numerical method to solve an inverse source problem for parabolic equations and apply it to solve a nonlinear coefficient inverse problem. The inverse source problem in this paper is the problem…
Mean Field Game (MFG) systems describe equilibrium configurations in games with infinitely many interacting controllers. We are interested in the behavior of this system as the horizon becomes large, or as the discount factor tends to $0$.…
In this paper we study a fully discrete Semi-Lagrangian approximation of a second order Mean Field Game system, which can be degenerate. We prove that the resulting scheme is well posed and, if the state dimension is equals to one, we prove…
We present a Reinforcement Learning (RL) algorithm to solve infinite horizon asymptotic Mean Field Game (MFG) and Mean Field Control (MFC) problems. Our approach can be described as a unified two-timescale Mean Field Q-learning: The…
This paper proposes a multiscale method for solving the numerical solution of mean field games which accelerates the convergence and addresses the problem of determining the initial guess. Starting from an approximate solution at the…
The second order Mean Field Games system (MFGS) in a bounded domain with the lateral Cauchy data is considered. This means that both Dirichlet and Neumann boundary data for the solution the MFGS are given. Two H\"older stability estimates…
By following the study in [24], we consider an inverse boundary problem for the mean field game system where a probability density constraint is enforced on the game agents. That is, we consider the case that reflective boundary conditions…
This paper concerns a Mean Field Game (MFG) system related to a Nash type equilibrium for dynamical games associated to large populations. One shows that the MFG system may be viewed as the Euler-Lagrange system for an optimal control…
An $\left( n+1\right) -$D coefficient inverse problem for the radiative stationary transport equation is considered for the first time. A globally convergent so-called convexification numerical \ method is developed and its convergence…
We address the numerical approximation of Mean Field Games with local couplings. For power-like Hamiltonians, we consider both unconstrained and constrained stationary systems with density constraints in order to model hard congestion…
In the present work, we study deterministic mean field games (MFGs) with finite time horizon in which the dynamics of a generic agent is controlled by the acceleration. They are described by a system of PDEs coupling a continuity equation…
Financial markets are often driven by latent factors which traders cannot observe. Here, we address an algorithmic trading problem with collections of heterogeneous agents who aim to perform optimal execution or statistical arbitrage, where…
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…
We consider the one-dimensional stationary first-order mean-field game (MFG) system with the coupling between the Hamilton-Jacobi equation and the transport equation. In both cases that the coupling is strictly increasing and decreasing…
Mean field games (MFG) and mean field control (MFC) problems have been introduced to study large populations of strategic players. They correspond respectively to non-cooperative or cooperative scenarios, where the aim is to find the Nash…