Cover Image

Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Feng, Yi, Li, Ping, Panageas, Ioannis, Wang, Xiao
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
by: Lei, Qi, et al.
Published: (2020)

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

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
by: Leonardos, Stefanos, et al.
Published: (2021)

Efficient Last-iterate Convergence Algorithms in Solving Games
by: Meng, Linjian, et al.
Published: (2023)

Last-iterate Convergence for Symmetric, General-sum, $2 \times 2$ Games Under The Exponential Weights Dynamic
by: Wang, Guanghui, et al.
Published: (2025)

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
by: Maiti, Arnab, et al.
Published: (2026)

Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
by: Barakat, Anas, et al.
Published: (2026)

Reducing Optimism Bias in Incomplete Cooperative Games
by: Úradník, Filip, et al.
Published: (2024)

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

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

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

Optimism Without Regularization: Constant Regret in Zero-Sum Games
by: Lazarsfeld, John, et al.
Published: (2025)

Last-iterate Convergence in Regularized Graphon Mean Field Game
by: Dong, Jing, et al.
Published: (2024)

Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games
by: Dadi, Leello, et al.
Published: (2024)

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

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2025)

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

Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem
by: Kalogiannis, Fivos, et al.
Published: (2024)

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

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

Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation
by: Ren, Hang, et al.
Published: (2025)

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

From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications
by: Cai, Yang, et al.
Published: (2025)

Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Games
by: Feng, Yi, et al.
Published: (2025)

State-Constrained Zero-Sum Differential Games with One-Sided Information
by: Ghimire, Mukesh, et al.
Published: (2024)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

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

Scale-Invariant Fast Convergence in Games
by: Tsuchiya, Taira, et al.
Published: (2026)

Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
by: Dong, Jing, et al.
Published: (2024)

Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
by: Kontogiannis, Andreas, et al.
Published: (2025)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2024)

Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints
by: Patris, Nikolas, et al.
Published: (2024)

Multi-Player Zero-Sum Markov Games with Networked Separable Interactions
by: Park, Chanwoo, et al.
Published: (2023)

Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
by: Lin, Shishen
Published: (2025)

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

Learning to Steer Learners in Games
by: Zhang, Yizhou, et al.
Published: (2025)

On the Decomposition of Differential Game
by: Zhou, Nanxiang, et al.
Published: (2024)

Prudent-Banker: No Extra Fees for Baseline Safety in Adversarial Bandits With and Without Delays
by: Hu, Ting, et al.
Published: (2026)