Learning in games with continuous action sets and unknown payoff functions
Not on the map. Why?
Abstract (arXiv)
This paper examines the convergence of no-regret learning in games with continuous action sets. For concreteness, we focus on learning via "dual averaging", a widely used class of no-regret learning schemes where players take small steps along their individual payoff gradients and then "mirror" the output back to their action sets. In terms of feedback, we assume that players can only estimate their payoff gradients up to a zero-mean error with bounded variance. To study the convergence of the induced sequence of play, we introduce the notion of variational stability, and we show that stable equilibria are locally attracting with high probability whereas globally stable equilibria are globally attracting with probability 1. We also discuss some applications to mixed-strategy learning in finite games, and we provide explicit estimates of the method's convergence speed.
Key facts. Cited by 78 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Aug 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 17; 2022: 17; 2023: 18; 2024: 10; 2025: 11; 2026: 5.
78 papers.
Sort:
By area:
- 2021Decentralized Q-Learning in Zero-sum Markov Gamescited by 53
- 2021Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibriumcited by 51
- 2021Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivitycited by 43
- 2022Multiplayer Performative Prediction: Learning in Decision-Dependent Gamescited by 42
- 2022Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methodscited by 37
- 2021Stochastic Extragradient: General Analysis and Improved Ratescited by 31
- 2021The Confluence of Networks, Games and Learningcited by 26
- 2021Beyond Exact Gradients: Convergence of Stochastic Soft-Max Policy Gradient Methods with Entropy Regularizationcited by 25
- 2022Near-Optimal No-Regret Learning Dynamics for General Convex Gamescited by 25
- 2021Survival of the strictest: Stable and unstable equilibria under regularized learning with partial informationcited by 22
- 2022A unified stochastic approximation framework for learning in gamescited by 22
- 2024Magnetic Preference Optimization: Achieving Last-iterate Convergence for Language Model Alignmentcited by 20
38 more
- 2022No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separationcited by 17
- 2021Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedbackcited by 14
- 2023Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditionscited by 14
- 2022Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noisecited by 13
- 2022On the convergence of policy gradient methods to Nash equilibria in general stochastic gamescited by 13
- 2021The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalitiescited by 12
- 2023Doubly Optimal No-Regret Learning in Monotone Gamescited by 12
- 2023Mastering Strategy Card Game (Legends of Code and Magic) via End-to-End Policy and Optimistic Smooth Fictitious Playcited by 10
- 2023Mastering Strategy Card Game (Hearthstone) with Improved Techniquescited by 10
- 2021Follow-the-Regularized-Leader Routes to Chaos in Routing Gamescited by 9
- 2022First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problemscited by 9
- 2022Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Gamescited by 9
- 2023Adaptively Perturbed Mirror Descent for Learning in Gamescited by 9
- 2025Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedbackcited by 9
- 2021Inducing Equilibria via Incentives: Simultaneous Design-and-Play Ensures Global Convergencecited by 8
- 2023Partially Personalized Federated Learning: Breaking the Curse of Data Heterogeneitycited by 8
- 2021Learning in nonatomic games, Part I: Finite action spaces and population gamescited by 6
- 2022Learning Stationary Nash Equilibrium Policies in n-Player Stochastic Games with Independent Chainscited by 6
- 2023Asymptotic Convergence and Performance of Multi-Agent Q-Learning Dynamicscited by 6
- 2023Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinementscited by 6
- 2023Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedbackcited by 6
- 2022Perseus: A Simple and Optimal High-Order Method for Variational Inequalitiescited by 5
- 2025Multiplayer Federated Learning: Reaching Equilibrium with Less Communicationcited by 5
- 2025Expected Variational Inequalitiescited by 5
- 2021Adaptive first-order methods revisited: Convex optimization without Lipschitz requirementscited by 4
- 2022Differentiable Bilevel Programming for Stackelberg Congestion Gamescited by 4
- 2023Learning in quantum gamescited by 4
- 2023The equivalence of dynamic and strategic stability under regularized learning in gamescited by 4
- 2024A geometric decomposition of finite games: Convergence vs. recurrence under exponential weightscited by 4
- 2024Learning to Control Unknown Strongly Monotone Gamescited by 4
- 2024No-regret learning in harmonic games: Extrapolation in the face of conflicting interestscited by 4
- 2021Distributed stochastic optimization with large delayscited by 3
- 2024Understanding Model Selection For Learning In Strategic Environmentscited by 3
- 2024Proximal Point Method for Online Saddle Point Problemcited by 3
- 2023Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computationcited by 2
- 2023Payoff-based learning with matrix multiplicative weights in quantum gamescited by 2
- 2023Exploiting hidden structures in non-convex games for convergence to Nash equilibriumcited by 2
- 2024Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approachcited by 2
50 most cited of 78 All 78 (JSON)
- 2026Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chains1 Oct 2026
- 2026Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities14 Sep 2026
- 2026Regret, equilibrium, and learning in games: A guided tour10 Aug 2026
- 2026Last-Iterate Guarantees for Learning in Co-coercive Games21 Apr 2026
- 2026Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD11 Apr 2026
- 2025Robust equilibria in continuous games: From strategic to dynamic robustness9 Dec 2025
- 2025Multi-agent learning under uncertainty: Recurrence vs. concentration9 Dec 2025
- 2025A regret minimization approach to fixed-point iterations25 Sep 2025
- 2025A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization9 Sep 2025
- 2025Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games3 Jul 2025
- 2025The impact of uncertainty on regularized learning in games16 Jun 2025
- 2025Hamiltonian of polymatrix zero-sum games19 May 2025
38 more
- 2025Convergence and Connectivity: Dynamics of Multi-Agent Q-Learning in Random Networks13 Mar 2025
- 2025Expected Variational Inequalities25 Feb 2025
- 2025Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback24 Feb 2025
- 2025Multiplayer Federated Learning: Reaching Equilibrium with Less Communication14 Jan 2025
- 2024Accelerated regularized learning in finite N-person games29 Dec 2024
- 2024No-regret learning in harmonic games: Extrapolation in the face of conflicting interests28 Dec 2024
- 2024Magnetic Preference Optimization: Achieving Last-iterate Convergence for Language Model Alignment22 Oct 2024
- 2024Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach31 Jul 2024
- 2024Nested replicator dynamics, nested logit choice, and similarity-based learning25 Jul 2024
- 2024Proximal Point Method for Online Saddle Point Problem5 Jul 2024
- 2024Learning to Control Unknown Strongly Monotone Games30 Jun 2024
- 2024Is Thompson Sampling Susceptible to Algorithmic Collusion?23 May 2024
- 2024A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights12 May 2024
- 2024Understanding Model Selection For Learning In Strategic Environments12 Feb 2024
- 2023Exploiting hidden structures in non-convex games for convergence to Nash equilibrium27 Dec 2023
- 2023Scalable and Independent Learning of Nash Equilibrium Policies in n-Player Stochastic Games with Unknown Independent Chains4 Dec 2023
- 2023Payoff-based learning with matrix multiplicative weights in quantum games4 Nov 2023
- 2023The equivalence of dynamic and strategic stability under regularized learning in games4 Nov 2023
- 2023Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback21 Oct 2023
- 2023Stability of Multi-Agent Learning: Convergence in Network Games with Many Players26 Jul 2023
- 2023Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation29 Jun 2023
- 2023Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements28 Jun 2023
- 2023Partially Personalized Federated Learning: Breaking the Curse of Data Heterogeneity29 May 2023
- 2023Adaptively Perturbed Mirror Descent for Learning in Games26 May 2023
- 2023Mastering Strategy Card Game (Hearthstone) with Improved Techniques9 Mar 2023
- 2023Mastering Strategy Card Game (Legends of Code and Magic) via End-to-End Policy and Optimistic Smooth Fictitious Play7 Mar 2023
- 2023Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions27 Feb 2023
- 2023Learning in quantum games5 Feb 2023
- 2023Doubly Optimal No-Regret Learning in Monotone Games30 Jan 2023
- 2023Asymptotic Convergence and Performance of Multi-Agent Q-Learning Dynamics23 Jan 2023
- 2023ApproxED: Approximate exploitability descent via learned best responses20 Jan 2023
- 2023Global Nash Equilibrium in Non-convex Multi-player Game: Theory and Algorithms19 Jan 2023
- 2022Offline Reinforcement Learning for Human-Guided Human-Machine Interaction with Private Information23 Dec 2022
- 2022Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks29 Nov 2022
- 2022The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness15 Nov 2022
- 2022On the convergence of policy gradient methods to Nash equilibria in general stochastic games17 Oct 2022
- 2022Differentiable Bilevel Programming for Stackelberg Congestion Games15 Sep 2022
- 2022Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games21 Aug 2022
50 newest of 78 All 78 (JSON)
- 2021Decentralized Q-Learning in Zero-sum Markov Gamescited by 53
- 2021Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibriumcited by 51
- 2021Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivitycited by 43
- 2022Multiplayer Performative Prediction: Learning in Decision-Dependent Gamescited by 42
- 2022Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methodscited by 37
- 2021Stochastic Extragradient: General Analysis and Improved Ratescited by 31
- 2021The Confluence of Networks, Games and Learningcited by 26
- 2021Beyond Exact Gradients: Convergence of Stochastic Soft-Max Policy Gradient Methods with Entropy Regularizationcited by 25
- 2022Near-Optimal No-Regret Learning Dynamics for General Convex Gamescited by 25
- 2021Survival of the strictest: Stable and unstable equilibria under regularized learning with partial informationcited by 22
- 2022A unified stochastic approximation framework for learning in gamescited by 22
- 2022No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separationcited by 17
12 most cited of 76 All 76 (JSON)
- 2026Fully Online Decentralized Learning in Stochastic Games with Unknown Independent Chains1 Oct 2026
- 2026Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities14 Sep 2026
- 2026Regret, equilibrium, and learning in games: A guided tour10 Aug 2026
- 2026Last-Iterate Guarantees for Learning in Co-coercive Games21 Apr 2026
- 2026Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD11 Apr 2026
- 2025Robust equilibria in continuous games: From strategic to dynamic robustness9 Dec 2025
- 2025Multi-agent learning under uncertainty: Recurrence vs. concentration9 Dec 2025
- 2025A regret minimization approach to fixed-point iterations25 Sep 2025
- 2025A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization9 Sep 2025
- 2025Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games3 Jul 2025
- 2025The impact of uncertainty on regularized learning in games16 Jun 2025
- 2025Hamiltonian of polymatrix zero-sum games19 May 2025
12 newest of 76 All 76 (JSON)