mlsanityData to 7 Oct 2026

Learning in nonatomic games, Part I: Finite action spaces and population games

arXiv 2107.01595 ↗First posted 4 Jul 2021cs.GT cs.LG math.OCcited by 6

Not on the map. Why?

Abstract (arXiv)

We examine the long-run behavior of a wide range of dynamics for learning in nonatomic games, in both discrete and continuous time. The class of dynamics under consideration includes fictitious play and its regularized variants, the best-reply dynamics (again, possibly regularized), as well as the dynamics of dual averaging / "follow the regularized leader" (which themselves include as special cases the replicator dynamics and Friedman's projection dynamics). Our analysis concerns both the actual trajectory of play and its time-average, and we cover potential and monotone games, as well as games with an evolutionarily stable state (global or otherwise). We focus exclusively on games with finite action spaces; nonatomic games with continuous action spaces are treated in detail in Part II of this paper.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 7 of its 59 references that are in the map. First posted on arXiv 4 Jul 2021.

Builds on

7 of 59 references.

References · 7

  1. 2016Learning in games with continuous action sets and unknown payoff functionscited by 78
  2. 2016Riemannian game dynamicscited by 18
  3. 2014A continuous-time approach to online optimizationcited by 12
  4. 2020Online non-convex optimization with imperfect feedbackcited by 10
  5. 2015Finite composite games: Equilibria and dynamicscited by 8
  6. 2014On the robustness of learning in games with stochastically perturbed payoff observationscited by 7
  7. 2016On the convergence of gradient-like flows with noisy gradient inputcited by 7

Built on by

Cited by year

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

6 papers.