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 showthat equilibriumstrategy profiles of a graphon game provide approximate Nash equilibria for the finite-player games. Connections with mean field games are discussed. Amotivating application of Cournot competition is presented, and explicit computation of its Nash equilibrium is provided.
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Management Science and Operations Research
- Graphon games
- Mean field games