Related papers: A remark on Uzawa's algorithm and an application t…

In this paper, we investigate the robustness of stationary mean-field equilibria in the presence of model uncertainties, specifically focusing on infinite-horizon discounted cost functions. To achieve this, we initially establish…

In this paper, we consider mean-field games where the interaction of each player with the mean-field takes into account not only the states of the players but also their collective behavior, To do so, we develop a random variable framework…

The Uzawa algorithm is an iterative method for the solution of saddle-point problems, which arise in many applications, including fluid dynamics. Viewing the Uzawa algorithm as a fixed- point iteration, we explore the use of Anderson…

We provide an abstract framework for submodular mean field games and identify verifiable sufficient conditions that allow to prove existence and approximation of strong mean field equilibria in models where data may not be continuous with…

In the context of simple finite-state discrete time systems, we introduce a generalization of mean field game solution, called correlated solution, which can be seen as the mean field game analogue of a correlated equilibrium. Our notion of…

Based on the Uzawa algorithm, we consider an adaptive finite element method for the Stokes system. We prove linear convergence with optimal algebraic rates for the residual estimator (which is equivalent to the total error), if the arising…

We consider a stationary Mean Field Games system defined on a network. In this framework, the transition conditions at the vertices play a crucial role: the ones here considered are based on the optimal control interpretation of the…

We develop a probabilistic approach to continuous-time finite state mean field games. Based on an alternative description of continuous-time Markov chain by means of semimartingale and the weak formulation of stochastic optimal control, our…

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…

The goal of the paper is to introduce a formulation of the mean field game with major and minor players as a fixed point on a space of controls. This approach emphasizes naturally the role played by McKean-Vlasov dynamics in some of the…

By using the Ishikawa iterative algorithm, we approximate the fixed points and the best proximity points of a relatively non expansive mapping. Also, we use the von Neumann sequence to prove the convergence result in a Hilbert space…

In this paper, we use mean field games (MFGs) to investigate approximations of $N$-player games with uniformly symmetrically continuous heterogeneous closed-loop actions. To incorporate agents' risk aversion (beyond the classical expected…

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…

We consider mean field games with discrete state spaces (called discrete mean field games in the following) and we analyze these games in continuous and discrete time, over finite as well as infinite time horizons. We prove the existence of…

The objective of this paper is to analyze the existence of equilibria for a class of deterministic mean field games of controls. The interaction between players is due to both a congestion term and a price function which depends on the…

We present a new notion of solution for mean field games master equations. This notion allows us to work with solutions which are merely continuous. We prove first results of uniqueness and stability for such solutions. It turns out that…

In this work, we present a numerical solver for optimal control problems constrained by linear and semi-linear second-order elliptic PDEs. The approach is based on recasting the problem and includes an extension of Uzawa's algorithm to…

In Mean Field Games of Controls, the dynamics of the single agent is influenced not only by the distribution of the agents, as in the classical theory, but also by the distribution of their optimal strategies. In this paper, we study…

In this paper we consider symmetric games where a large number of players can be in any one of d states. We derive a limiting mean field model and characterize its main properties. This mean field limit is a system of coupled ordinary…

The purpose of this work is to pose and solve the problem to guide a collection of weakly interacting dynamical systems (agents, particles, etc.) to a specified terminal distribution. The framework is that of mean-field and of cooperative…