Related papers: A fully-discrete Semi-Lagrangian scheme for a firs…

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…

In this work, we consider a first order mean field games system with non-local couplings. A Lagrange-Galerkin scheme for the continuity equation, coupled with a semi-Lagrangian scheme for the Hamilton-Jacobi-Bellman equation, is proposed to…

Here, we examine a fully-discrete Semi-Lagrangian scheme for a mean-field game price formation model. We show the existence of the solution of the discretized problem and that it is monotone as a multivalued operator. Moreover, we show that…

We construct a semi-Lagrangian scheme for first-order, time-dependent, and non-local Mean Field Games. The convergence of the scheme to a weak solution of the system is analyzed by exploiting a key monotonicity property. To solve the…

We provide an approximation scheme for first-order stationary mean field games with a separable Hamiltonian. First, we discretize Hamilton-Jacobi equations by discretizing in time, and then prove the existence of minimizing holonomic…

In this paper we propose a high-order numerical scheme for time-dependent mean field games systems. The scheme, which is built by combining Lagrange-Galerkin and semi-Lagrangian techniques, is consistent and stable for large time steps…

For a class of finite horizon first order mean field games and associated N-player games, we give a simple proof of convergence of symmetric N-player Nash equilibria in distributed open-loop strategies to solutions of the mean field game in…

In this article, we introduce a method to approximate solutions of some variational mean field game problems with congestion, by finite sets of player trajectories. These trajectories are obtained by solving a minimization problem similar…

We introduce a fully discrete scheme to solve a class of high-dimensional Mean Field Games systems. Our approach couples semi-Lagrangian (SL) time discretizations with Tensor-Train (TT) decompositions to tame the curse of dimensionality. By…

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…

We present and analyze an approximation scheme for the two-dimensional game $p$-Laplacian in the framework of viscosity solutions. The approximation is based on a semi-Lagrangian scheme which exploits the idea of $p$-averages. We study the…

This article focuses two issues related to the first-order discounted mean field games system. The first is the time discretization problem. The time discretization approach enables us to prove the existence of solutions (u,m) of the…

We construct numerical approximations for Mean Field Games with fractional or nonlocal diffusions. The schemes are based on semi-Lagrangian approximations of the underlying control problems/games along with dual approximations of the…

We propose a new convergent time semi-discrete scheme for the stochastic Landau-Lifshitz-Gilbert equation. The scheme is only linearly implicit and does not require the resolution of a nonlinear problem at each time step. Using a martingale…

We propose a numerical method for stationary Mean Field Games defined on a network. In this framework a correct approximation of the transition conditions at the vertices plays a crucial role. We prove existence, uniqueness and convergence…

We address the numerical solution of second-order Mean Field Game problems through Newton iterations in infinite dimensions, introduced in [14], where quadratic convergence of the method was rigorously established. Building upon this…

We study the existence of classical solutions to a broad class of local, first order, forward-backward Extended Mean Field Games systems, that includes standard Mean Field Games, Mean Field Games with congestion, and mean field type control…

Here, we prove the existence of solutions to first-order mean-field games (MFGs) arising in optimal switching. First, we use the penalization method to construct approximate solutions. Then, we prove uniform estimates for the penalized…

Here, we consider a regularized mean-field game model that features a low-order regularization. We prove the existence of solutions with positive density. To do so, we combine a priori estimates with the continuation method. In contrast…

We study a particle approximation for one-dimensional first-order Mean-Field-Games (MFGs) with local interactions with planning conditions. Our problem comprises a system of a Hamilton-Jacobi equation coupled with a transport equation. As…