Stochastic Graphon Games: I. The Static Case

2022/02/01 by René Carmona, Daniel B. Cooney, Christy V. Graves +1 · 5 citations

paper · doi:10.1287/moor.2021.1148

Abstract

We consider static finite-player network games and their continuum analogs graphon games. Existence and uniqueness results are provided as well as convergence of the finite-player network game optimal strategy profiles to their analogs for the graphon games. We also show that equilibrium strategy profiles of a graphon game provide approximate Nash equilibria for the finite-player games. Connections with mean field games are discussed. A motivating application of Cournot competition is presented, and explicit computation of its Nash equilibrium is provided.

Cited by

• Heterogeneous Mean Field Games and Local Well-posedness
• An Overview of Some Extensions of Mean Field Games beyond Perfect Homogeneity and Anonymity
• Mean-field limits à la Tanaka and large deviations for particle systems with network interactions
• Optimal interventions in opinion dynamics on large-scale, time-varying, random networks
• Nash Equilibria of Noncooperative/Mixed Differential Games with Density Constraints in Infinite Dimensions

Related

• Stochastic Graphon Games: I. The Static Case
• Stochastic Graphon Games with Memory
• Graphon games and an idealized limit of large network games
• Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm
• A label-state formulation of stochastic graphon games and approximate equilibria on large networks