Related papers: Obstacle Mean-Field Game Problem
Mean-field games arise in various fields including economics, engineering, and machine learning. They study strategic decision making in large populations where the individuals interact via certain mean-field quantities. The ground metrics…
We study first order evolutive Mean Field Games where the Hamiltonian is non-coercive. This situation occurs, for instance, when some directions are "forbidden" to the generic player at some points. We establish the existence of a weak…
This paper introduces a framework of Constrained Mean-Field Games (CMFGs), where each agent solves a constrained Markov decision process (CMDP). This formulation captures scenarios in which agents' strategies are subject to feasibility,…
We consider an optimal control problem in which the state is governed by an unilateral obstacle problem (with obstacle from below) and restricted by a pointwise state constraint (from above). In the presence of control constraints, we…
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…
We give a definition for Obstacle Problems with measure data and general obstacles. For such problems we prove existence and uniqueness of solutions and consistency with the classical theory of Variational Inequalities. Continuous…
We study the uniqueness of solutions to systems of PDEs arising in Mean Field Games with several populations of agents and Neumann boundary conditions. The main assumption requires the smallness of some data, e.g., the length of the time…
We analyze a posteriori error bounds for stabilized finite element discretizations of second-order steady-state mean field games. We prove the local equivalence between the $H^1$-norm of the error and the dual norm of the residual. We then…
Let us consider the autonomous obstacle problem \begin{equation*} \min_v \int_\Omega F(Dv(x)) \, dx \end{equation*} on a specific class of admissible functions, where we suppose the Lagrangian satisfies proper hypotheses of convexity and…
We derive a framework to compute optimal controls for problems with states in the space of probability measures. Since many optimal control problems constrained by a system of ordinary differential equations (ODE) modelling interacting…
We consider a mean-field game model where the cost functions depend on a fixed parameter, called \textit{state}, which is unknown to players. Players learn about the state from a a stream of private signals they receive throughout the game.…
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several steps. First an adversary selects a completely satisfiable…
In this paper, we consider Mean Field Games in the presence of common noise relaxing the usual independence assumption of individual random noise. We assume a simple linear model with terminal cost satisfying a convexity and a weak…
We propose a single-level numerical approach to solve Stackelberg mean field game (MFG) problems. In Stackelberg MFG, an infinite population of agents play a non-cooperative game and choose their controls to optimize their individual…
In this paper we study evolutive first order Mean Field Games in the Heisenberg group~$\He^1$; each agent can move only along "horizontal" trajectories which are given in terms of the vector fields generating~$\He^1$ and the kinetic part of…
In this paper, we study a priori estimates for a first-order mean-field planning problem with a potential. In the theory of mean-field games (MFGs), a priori estimates play a crucial role to prove the existence of classical solutions. In…
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…
In this article we study the well-posedness of the Master Equation of Mean Field Games in a framework of Neumann boundary condition. The definition of solution is closely related to the classical one of the Mean Field Games system, but the…
Recent techniques based on Mean Field Games (MFGs) allow the scalable analysis of multi-player games with many similar, rational agents. However, standard MFGs remain limited to homogeneous players that weakly influence each other, and…
We analyze an $N+1$-player game and the corresponding mean field game with state space $\{0,1\}$. The transition rate of $j$-th player is the sum of his control $\alpha^j$ plus a minimum jumping rate $\eta$. Instead of working under…