ﻻ يوجد ملخص باللغة العربية
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 solution of the system via a vanishing viscosity method and, mainly, we prove that the evolution of the populations density is the push-forward of the initial density through the flow characterized almost everywhere by the optimal trajectories of the control problem underlying the Hamilton-Jacobi equation. As preliminary steps, we need that the optimal trajectories for the control problem are unique (at least for a.e. starting points) and that the optimal controls can be expressed in terms of the horizontal gradient of the value function.
We study first order evolutive Mean Field Games whose operators are non-coercive. This situation occurs, for instance, when some directions are `forbidden to the generic player at some points. Under some regularity assumptions, we establish existence
We study the asymptotic behavior of solutions to the constrained MFG system as the time horizon $T$ goes to infinity. For this purpose, we analyze first Hamilton-Jacobi equations with state constraints from the viewpoint of weak KAM theory, construct
In this manuscript, we propose a structural condition on non-separable Hamiltonians, which we term displacement monotonicity condition, to study second order mean field games master equations. A rate of dissipation of a bilinear form is brought to be
In this paper we study second order master equations arising from mean field games with common noise over arbitrary time duration. A classical solution typically requires the monotonicity condition (or small time duration) and sufficiently smooth dat
In this note we prove the uniqueness of solutions to a class of Mean Field Games systems subject to possibly degenerate individual noise. Our results hold true for arbitrary long time horizons and for general non-separable Hamiltonians that satisfy a