Discrete-time average-cost mean-field games on Polish spaces

Authors : Naci Saldi

Pages : 463-480

Doi:10.3906/mat-1905-2

View : 14 | Download : 9

Publication Date : 9999-12-31

Article Type : Makaleler

Abstract :In stochastic dynamic games, when the number of players is sufficiently large and the interactions between agents depend on empirical state distribution, one way to approximate the original game is to introduce infinitepopulation limit of the problem. In the infinite population limit, a generic agent is faced with a so-called mean-field game. In this paper, we study discrete-time mean-field games with average-cost criteria. Using average cost optimality equation and Kakutani’s fixed point theorem, we establish the existence of Nash equilibria for mean-field games under drift and minorization conditions on the dynamics of each agent. Then, we show that the equilibrium policy in the mean-field game, when adopted by each agent, is an approximate Nash equilibrium for the corresponding finite-agent game with sufficiently many agents.
Keywords : Mean-field games, average cost, approximate Nash equilibrium