mlsanityData to 7 Oct 2026

Riemannian game dynamics

arXiv 1603.09173 ↗First posted 30 Mar 2016math.OC cs.GT math.DScited by 18

Not on the map. Why?

Abstract (arXiv)

We study a class of evolutionary game dynamics defined by balancing a gain determined by the game's payoffs against a cost of motion that captures the difficulty with which the population moves between states. Costs of motion are represented by a Riemannian metric, i.e., a state-dependent inner product on the set of population states. The replicator dynamics and the (Euclidean) projection dynamics are the archetypal examples of the class we study. Like these representative dynamics, all Riemannian game dynamics satisfy certain basic desiderata, including positive correlation and global convergence in potential games. Moreover, when the underlying Riemannian metric satisfies a Hessian integrability condition, the resulting dynamics preserve many further properties of the replicator and projection dynamics. We examine the close connections between Hessian game dynamics and reinforcement learning in normal form games, extending and elucidating a well-known link between the replicator dynamics and exponential reinforcement learning.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Mar 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 2; 2023: 1; 2024: 7; 2025: 2.

18 papers.

Sort:

  1. 2021The Confluence of Networks, Games and Learningcited by 26
  2. 2021The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalitiescited by 12
  3. 2022First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spacescited by 10
  4. 2021Follow-the-Regularized-Leader Routes to Chaos in Routing Gamescited by 9
  5. 2023Riemannian stochastic optimization methods avoid strict saddle pointscited by 8
  6. 2021Learning in nonatomic games, Part I: Finite action spaces and population gamescited by 6
  7. 2021Zeroth-order non-convex learning via hierarchical dual averagingcited by 6
  8. 2021Adaptive first-order methods revisited: Convex optimization without Lipschitz requirementscited by 4
  9. 2024A geometric decomposition of finite games: Convergence vs. recurrence under exponential weightscited by 4
  10. 2024Connections between sequential Bayesian inference and evolutionary dynamicscited by 4
  11. 2024No-regret learning in harmonic games: Extrapolation in the face of conflicting interestscited by 4
  12. 2022Review of Metrics to Measure the Stability, Robustness and Resilience of Reinforcement Learningcited by 2
6 more
  1. 2024Accelerated regularized learning in finite N-person gamescited by 2
  2. 2025The impact of uncertainty on regularized learning in gamescited by 2
  3. 2024Nested replicator dynamics, nested logit choice, and similarity-based learningcited by 0
  4. 2024Evolution of Societies via Reinforcement Learningcited by 0
  5. 2024The Bounds of Algorithmic Collusion; Q-learning, Gradient Learning, and the Folk Theoremcited by 0
  6. 2025Spike-timing-dependent Hebbian learning as noisy gradient descentcited by 0