Cover Image

The Oracle Complexity of Simplex-based Matrix Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kornowski, Guy, Shamir, Ohad
Format:	Preprint
Published:	2024
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 the Complexity of Finding Small Subgradients in Nonsmooth Optimization
by: Kornowski, Guy, et al.
Published: (2022)

Open Problem: Anytime Convergence Rate of Gradient Descent
by: Kornowski, Guy, et al.
Published: (2024)

An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization
by: Kornowski, Guy, et al.
Published: (2023)

Gradient Descent's Last Iterate is Often (slightly) Suboptimal
by: Kornowski, Guy, et al.
Published: (2026)

On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization
by: Kornowski, Guy, et al.
Published: (2024)

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

Convergence of Regret Matching in Potential Games and Constrained Optimization
by: Anagnostides, Ioannis, 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)

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

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
by: Faizal, Fathima Zarin, 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)

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

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

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

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

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)

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)

On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games
by: Cai, Yang, 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)

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 Guarantees for Learning in Co-coercive Games
by: Chandak, Siddharth, et al.
Published: (2026)

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

Aspiration-based Perturbed Learning Automata in Games with Noisy Utility Measurements. Part A: Stochastic Stability in Non-zero-Sum Games
by: Chasparis, Georgios C.
Published: (2025)

PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium
by: Ding, Shihong, et al.
Published: (2023)

Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games
by: Yang, Tong, et al.
Published: (2025)

Solving Zero-Sum Convex Markov Games
by: Kalogiannis, Fivos, et al.
Published: (2025)

Learning in Mean Field Games: A Survey
by: Laurière, Mathieu, et al.
Published: (2022)

Solving Matrix Games with Near-Optimal Matvec Complexity
by: Karmarkar, Ishani, et al.
Published: (2026)

Decoding Game: On Minimax Optimality of Heuristic Text Generation Strategies
by: Chen, Sijin, et al.
Published: (2024)

Learning from Delayed Feedback in Games via Extra Prediction
by: Fujimoto, Yuma, et al.
Published: (2025)

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

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

Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm
by: Zhou, Fuzhong, et al.
Published: (2024)

A pragmatic policy learning approach to account for users' fatigue in repeated auctions
by: Heymann, Benjamin, et al.
Published: (2024)