Cover Image

From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cai, Yang, Luo, Haipeng, Wei, Chen-Yu, Zheng, Weiqiang
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
by: Cai, Yang, et al.
Published: (2025)

Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
by: Cai, Yang, et al.
Published: (2024)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
by: Cai, Yang, et al.
Published: (2024)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation
by: Cai, Yang, et al.
Published: (2023)

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
by: Cai, Yang, et al.
Published: (2023)

Last-Iterate Guarantees for Learning in Co-coercive Games
by: Chandak, Siddharth, et al.
Published: (2026)

Convergence of Extragradient SVRG for Variational Inequalities: Error Bounds and Increasing Iterate Averaging
by: Nan, Tianlong, et al.
Published: (2023)

Policy Iteration for Two-Player General-Sum Stochastic Stackelberg Games
by: Kudo, Mikoto, et al.
Published: (2024)

Learning Zero-Sum Linear Quadratic Games with Improved Sample Complexity and Last-Iterate Convergence
by: Wu, Jiduan, et al.
Published: (2023)

Second-Order Mirror Descent: Convergence in Games Beyond Averaging and Discounting
by: Gao, Bolin, et al.
Published: (2021)

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, et al.
Published: (2025)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
by: Cai, Yang, et al.
Published: (2024)

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
by: Wang, Guillaume, et al.
Published: (2022)

On Tractable $Φ$-Equilibria in Non-Concave Games
by: Cai, Yang, et al.
Published: (2024)

Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games
by: Kamp, Serafina, et al.
Published: (2025)

Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
by: Cai, Yang, et al.
Published: (2025)

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
by: Chen, Zaiwei, et al.
Published: (2024)

Is Online Linear Optimization Sufficient for Strategic Robustness?
by: Cai, Yang, et al.
Published: (2026)

Linear Convergence in Games with Delayed Feedback via Extra Prediction
by: Fujimoto, Yuma, et al.
Published: (2026)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
by: Nayak, Anupam, et al.
Published: (2025)

Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities
by: Emmanouilidis, Konstantinos, et al.
Published: (2024)

The Oracle Complexity of Simplex-based Matrix Games
by: Kornowski, Guy, et al.
Published: (2024)

Optimistic Online Learning in Symmetric Cone Games
by: Barakat, Anas, et al.
Published: (2025)

Transforming Strategic Games into Biform Games: Applications in Allocation Mechanisms and Green Technology Investment
by: Shuwen, Xiang, et al.
Published: (2025)

Operator Splitting for Learning to Predict Equilibria in Convex Games
by: McKenzie, Daniel, et al.
Published: (2021)

Reinforcement Learning for Finite Space Mean-Field Type Games
by: Shao, Kai, et al.
Published: (2024)

Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
by: Yongacoglu, Bora, et al.
Published: (2021)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
by: Soleymani, Ashkan, et al.
Published: (2025)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
by: Faizal, Fathima Zarin, et al.
Published: (2024)

Small-Gain Nash: Certified Contraction to Nash Equilibria in Differentiable Games
by: Sharma, Vedansh
Published: (2025)

Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization
by: Sakos, Iosif, et al.
Published: (2023)

Near Optimal Convergence to Coarse Correlated Equilibrium in General-Sum Markov Games
by: Yorulmaz, Asrin Efe, et al.
Published: (2025)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
by: Ba, Wenjia, et al.
Published: (2021)

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games
by: Soleymani, Ashkan, et al.
Published: (2025)

Unsupervised Solution Operator Learning for Mean-Field Games via Sampling-Invariant Parametrizations
by: Huang, Han, et al.
Published: (2024)

Finite-Agent Stochastic Differential Games on Large Graphs: II. Graph-Based Architectures
by: Hu, Ruimeng, et al.
Published: (2025)

Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback
by: Jordan, Michael I., et al.
Published: (2023)

Last-Iterate Convergence of Anchored Gradient Descent
by: Cai, Yang, et al.
Published: (2026)

Optimal Online Bookmaking for Binary Games
by: Bhatt, Alankrita, et al.
Published: (2025)