Cover Image

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nayak, Anupam, Yang, Tong, Yagan, Osman, Joshi, Gauri, Chi, Yuejie
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computer Science and Game Theory Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
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)

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

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

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

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

Offline Two-Player Zero-Sum Markov Games with KL Regularization
by: Chen, Claire, et al.
Published: (2026)

Monotone Near-Zero-Sum Games: A Generalization of Convex-Concave Minimax
by: Luo, Ruichen, et al.
Published: (2025)

Faster Rates for No-Regret Learning in General Games via Cautious Optimism
by: Soleymani, Ashkan, 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)

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

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

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

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

On Non-Cooperative Perfect Information Semi-Markov Games
by: Bakshi, K. G., et al.
Published: (2022)

Solving Zero-Sum Games with Fewer Matrix-Vector Products
by: Karmarkar, Ishani, et al.
Published: (2025)

Markov Chains of Evolutionary Games with a Small Number of Players
by: Kehagias, Athanasios
Published: (2025)

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

Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets
by: Yang, Zixian, et al.
Published: (2025)

Minimal Regret Walras Equilibria for Combinatorial Markets
by: Duguet, Aloïs, 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)

Global Behavior of Learning Dynamics in Zero-Sum Games with Memory Asymmetry
by: Fujimoto, Yuma, et al.
Published: (2024)

From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications
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)

A Soft Inducement Framework for Incentive-Aided Steering of No-Regret Players
by: Yorulmaz, Asrin Efe, et al.
Published: (2025)

Certifying Concavity and Monotonicity in Games via Sum-of-Squares Hierarchies
by: Leon, Vincent, 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)

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

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)

Memory Asymmetry Creates Heteroclinic Orbits to Nash Equilibrium in Learning in Zero-Sum Games
by: Fujimoto, Yuma, et al.
Published: (2023)

Synchronization in Learning in Periodic Zero-Sum Games Triggers Divergence from Nash Equilibrium
by: Fujimoto, Yuma, et al.
Published: (2024)

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)

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)