A probabilistic numerical method for a class of mean field games

Author(s):  
Ben Aziza Sahar ◽  
Toumi Salwa

The Mean Field Games PDEs system is at the heart of the Mean Field Games theory initiated by [J.-M. Lasry and P.-L. Lions, Jeux à champ moyen. I–le cas stationnaire, C. R. Math. 343 (2006) 619–625; J.-M. Lasry and P.-L. Lions, Jeux à champ moyen. II–horizon fini et contrôle optimal, C. R. Math. 343 (2006) 679–684; J.-M. Lasry and P.-L. Lions, Mean field games, Jpn. J. Math. 2 (2007) 229–260] which constitutes a seminal contribution to the modeling and analysis of games with a large number of players. We propose here a numerical method of resolution of such systems based on the construction of a discrete mean field game where the controlled state-variable is a Markov chain approximating the controlled stochastic differential equation [H. Kushner and P. G. Dupuis, Numerical Methods for Stochastic Control Problems in Continuous Time, Stochastic Modeling and Applied Probability, Vol. 24 (Springer Science & Business Media, 2013)]. In particular, existence and uniqueness properties of the discrete MFG are investigated with convergence results under adequate assumptions.

Author(s):  
Alain Bensoussan ◽  
Jens Frehse ◽  
Phillip Yam
Keyword(s):  

2019 ◽  
Vol 29 (08) ◽  
pp. 1553-1583 ◽  
Author(s):  
Jean-David Benamou ◽  
Guillaume Carlier ◽  
Simone Di Marino ◽  
Luca Nenna

We propose an entropy minimization viewpoint on variational mean-field games with diffusion and quadratic Hamiltonian. We carefully analyze the time discretization of such problems, establish [Formula: see text]-convergence results as the time step vanishes and propose an efficient algorithm relying on this entropic interpretation as well as on the Sinkhorn scaling algorithm.


2010 ◽  
Vol 20 (04) ◽  
pp. 567-588 ◽  
Author(s):  
AIME LACHAPELLE ◽  
JULIEN SALOMON ◽  
GABRIEL TURINICI

Motivated by a mean field games stylized model for the choice of technologies (with externalities and economy of scale), we consider the associated optimization problem and prove an existence result. To complement the theoretical result, we introduce a monotonic algorithm to find the mean field equilibria. We close with some numerical results, including the multiplicity of equilibria describing the possibility of a technological transition.


2020 ◽  
Vol 9 (4) ◽  
Author(s):  
Thibault Bonnemain ◽  
Thierry Gobron ◽  
Denis Ullmo

Mean Field Games provide a powerful framework to analyze the dynamics of a large number of controlled agents in interaction. Here we consider such systems when the interactions between agents result in a negative coordination and analyze the behavior of the associated system of coupled PDEs using the now well established correspondence with the non linear Schrödinger equation. We focus on the long optimization time limit and on configurations such that the game we consider goes through different regimes in which the relative importance of disorder, interactions between agents and external potential vary, which makes possible to get insights on the role of the forward-backward structure of the Mean Field Game equations in relation with the way these various regimes are connected.


Author(s):  
Виктория Сергеевна Корниенко ◽  
Владимир Викторович Шайдуров ◽  
Евгения Дмитриевна Карепова

Представлен конечно-разностный аналог дифференциальной задачи, сформулированной в терминах теории “игр среднего поля” (mean field games). Задачи оптимизации такого типа формулируются как связанные системы параболических дифференциальных уравнений в частных производных типа Фоккера - Планка и Гамильтона - Якоби - Беллмана. Предложенный конечно-разностный аналог обладает основными свойствами оптимизационной дифференциальной задачи непосредственно на дискретном уровне. В итоге он может служить как приближение, сходящееся к исходной дифференциальной задаче при стремлении шагов дискретизации к нулю, так и как самостоятельная оптимизационная задача с конечным числом участников. Для предложенного аналога построен алгоритм монотонной минимизации функционала стоимости, проиллюстрированный на модельной экономической задаче In most forecasting problems, overstating or understating forecast leads to various losses. Traditionally, in the theory of “mean field games”, the functional responsible for the costs of implementing the interaction of the continuum of agents between each other is supposed to be dependent on the squared function of control of the system. Since additional external factors can influence the player’s strategy, the control function of a dynamic system is more complex. Therefore, the purpose of this article is to develop a computational algorithm applicable for more general set of control functions. As a research method, a computational experiment and proof of the stability of the constructed computational scheme are used in this study. As a result, the numerical algorithm was applied on the problem of economic interaction in the presence of alternative resources. We consider the model, in which a continuum of consumer agents consists of households deciding on heating, having a choice between the cost of installing and maintaining the thermal insulation or the additional cost of electricity. In the framework of the problem, the convergence of the method is numerically demonstrated. Conclusions. The article considers a model of the strategic interaction of continuum of agents, the interaction of which is determined by a coupled differential equations, namely, the Fokker - Planck and the Hamilton - Jacobi - Bellman one. To approximate the differential problem, difference schemes with a semi-Lagrangian approximation are used, which give a direct rule for minimizing the cost functional


Symmetry ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 14
Author(s):  
Luca Di Persio ◽  
Matteo Garbelli

We provide a rigorous mathematical formulation of Deep Learning (DL) methodologies through an in-depth analysis of the learning procedures characterizing Neural Network (NN) models within the theoretical frameworks of Stochastic Optimal Control (SOC) and Mean-Field Games (MFGs). In particular, we show how the supervised learning approach can be translated in terms of a (stochastic) mean-field optimal control problem by applying the Hamilton–Jacobi–Bellman (HJB) approach and the mean-field Pontryagin maximum principle. Our contribution sheds new light on a possible theoretical connection between mean-field problems and DL, melting heterogeneous approaches and reporting the state-of-the-art within such fields to show how the latter different perspectives can be indeed fruitfully unified.


2017 ◽  
Vol 23 (2) ◽  
pp. 569-591 ◽  
Author(s):  
Pierre Cardaliaguet ◽  
Saeed Hadikhanloo

Mean Field Game systems describe equilibrium configurations in differential games with infinitely many infinitesimal interacting agents. We introduce a learning procedure (similar to the Fictitious Play) for these games and show its convergence when the Mean Field Game is potential.


2016 ◽  
Vol 51 (1) ◽  
pp. 63-88 ◽  
Author(s):  
Simone Cacace ◽  
Fabio Camilli ◽  
Claudio Marchi

Sign in / Sign up

Export Citation Format

Share Document