mlsanityData to 14 Oct 2026

Stochastic Graphon Games: I. The Static Case

arXiv 1911.10664 ↗First posted 25 Nov 2019math.OC math.PRcited by 13

Not on the map. Why?

Abstract (arXiv)

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 and central planner optimization problems are discussed. Motivating applications are presented and explicit computations of their Nash equilibria and social optimal strategies are provided.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Nov 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2; 2023: 3; 2024: 4; 2025: 3.

13 papers.

Sort:

By area: