Learning in anonymous nonatomic games with applications to first-order mean field games

Abstract

We introduce a model of anonymous games with the player dependent action sets. We propose several learning procedures based on the well-known Fictitious Play and Online Mirror Descent and prove their convergence to equilibrium under the classical monotonicity condition. Typical examples are first-order mean field games.

Cited by in corpus (5)

• Finite mean field games: fictitious play and convergence to a first order continuous mean field game
• Scaling up Mean Field Games with Online Mirror Descent
• Nonsmooth Aggregative Games with Coupling Constraints and Infinitely Many Classes of Players
• Exploration noise for learning linear-quadratic mean field games
• Generalized conditional gradient and learning in potential mean field games