Cover Image

On the $O(1/T)$ Convergence of Alternating Gradient Descent-Ascent in Bilinear Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nan, Tianlong, Gupta, Shuvomoy Das, Iyengar, Garud, Kroer, Christian
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Contested Route Planning
by: Černý, Jakub, et al.
Published: (2025)

Layered Graph Security Games
by: Černý, Jakub, et al.
Published: (2024)

Spatial Branch-and-Bound for Computing Multiplayer Nash Equilibrium
by: Černý, Jakub, et al.
Published: (2025)

Contested Logistics: A Game-Theoretic Approach
by: Cerny, Jakub, et al.
Published: (2024)

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

On the Convergence of Tâtonnement for Linear Fisher Markets
by: Nan, Tianlong, et al.
Published: (2024)

Boosting Perturbed Gradient Ascent for Last-Iterate Convergence in Games
by: Abe, Kenshi, et al.
Published: (2024)

Tâtonnement Dynamics for Fisher Markets with Chores
by: Chaudhury, Bhaskar Ray, et al.
Published: (2025)

Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm
by: Chaudhury, Bhaskar Ray, et al.
Published: (2024)

GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms
by: Krever, Noah, et al.
Published: (2025)

Extensive-Form Game Solving via Blackwell Approachability on Treeplexes
by: Chakrabarti, Darshan, et al.
Published: (2024)

Colonel Blotto with Battlefield Games
by: Afiouni, Salam, et al.
Published: (2025)

Commitment to Sparse Strategies in Two-Player Games
by: Afiouni, Salam, et al.
Published: (2024)

Computing Lindahl Equilibrium for Public Goods with and without Funding Caps
by: Kroer, Christian, et al.
Published: (2025)

Shuffling Gradient Descent-Ascent with Variance Reduction for Nonconvex-Strongly Concave Smooth Minimax Problems
by: Jiang, Xia, et al.
Published: (2024)

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
by: Fan, Zhiyuan, et al.
Published: (2024)

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

A Direct Second-Order Method for Solving Two-Player Zero-Sum Games
by: Yang, David, et al.
Published: (2025)

Statistical Inference and A/B Testing in Fisher Markets and Paced Auctions
by: Liao, Luofeng, et al.
Published: (2024)

Bootstrapping Fisher Market Equilibrium and First-Price Pacing Equilibrium
by: Liao, Luofeng, et al.
Published: (2024)

Statistical Inference for Fisher Market Equilibrium
by: Liao, Luofeng, et al.
Published: (2022)

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

Gradient Manipulation in Distributed Stochastic Gradient Descent with Strategic Agents: Truthful Incentives with Convergence Guarantees
by: Chen, Ziqin, et al.
Published: (2026)

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

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

Convergence of $\text{log}(1/ε)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis
by: Anagnostides, Ioannis, et al.
Published: (2024)

Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
by: Lazarsfeld, John, et al.
Published: (2025)

Approximating N-Player Nash Equilibrium through Gradient Descent
by: Wang, Dongge, et al.
Published: (2025)

Pointwise Convergence in Games with Conflicting Interest
by: Zhou, Nanxiang, et al.
Published: (2025)

Fast Rates in $α$-Potential Games via Regularized Mirror Descent
by: Chen, Claire, et al.
Published: (2026)

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

Characterizing the Convergence of Game Dynamics via Potentialness
by: Bichler, Martin, et al.
Published: (2025)

On the Convergence of Learning Algorithms in Bayesian Auction Games
by: Bichler, Martin, et al.
Published: (2023)

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

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

Convergence of Fast Policy Iteration in Markov Games and Robust MDPs
by: Badger, Keith, et al.
Published: (2025)

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

Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback
by: Dong, Jing, et al.
Published: (2024)

Online Generalized-mean Welfare Maximization: Achieving Near-Optimal Regret from Samples
by: Yang, Zongjun, et al.
Published: (2026)

Adaptively Perturbed Mirror Descent for Learning in Games
by: Abe, Kenshi, et al.
Published: (2023)