Continuous-time Discounted Mirror-Descent Dynamics in Monotone Concave Games
Not on the map. Why?
Abstract (arXiv)
In this paper, we consider concave continuous-kernel games characterized by monotonicity properties and propose discounted mirror descent-type dynamics. We introduce two classes of dynamics whereby the associated mirror map is constructed based on a strongly convex or a Legendre regularizer. Depending on the properties of the regularizer we show that these new dynamics can converge asymptotically in concave games with monotone (negative) pseudo-gradient. Furthermore, we show that when the regularizer enjoys strong convexity, the resulting dynamics can converge even in games with hypo-monotone (negative) pseudo-gradient, which corresponds to a shortage of monotonicity.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Dec 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 1.
4 papers.
- 2022Learning Stationary Nash Equilibrium Policies in n-Player Stochastic Games with Independent Chainscited by 6
- 2024Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approachcited by 2
- 2021Second-Order Mirror Descent: Convergence in Games Beyond Averaging and Discountingcited by 1
- 2022No-regret learning for repeated non-cooperative games with lossy banditscited by 0
- 2024Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach31 Jul 2024
- 2022No-regret learning for repeated non-cooperative games with lossy bandits14 May 2022
- 2022Learning Stationary Nash Equilibrium Policies in n-Player Stochastic Games with Independent Chains28 Jan 2022
- 2021Second-Order Mirror Descent: Convergence in Games Beyond Averaging and Discounting18 Nov 2021