Cover Image

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Maiti, Arnab, Jamieson, Kevin, Ratliff, Lillian J.
Format:	Preprint
Published:	2023
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

Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
by: Maiti, Arnab, et al.
Published: (2023)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)

On the Universal Near Optimality of Hedge in Combinatorial Settings
by: Fan, Zhiyuan, et al.
Published: (2025)

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
by: Liu, Junyan, 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)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
by: Liu, Junyan, et al.
Published: (2026)

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

Leveraging Noisy Observations in Zero-Sum Games
by: Athanasakos, Emmanouil M, et al.
Published: (2024)

Two-Player Zero-Sum Games with Bandit Feedback
by: Yılmaz, Elif, et al.
Published: (2025)

Approximating Nash Equilibria in General-Sum Games via Meta-Learning
by: Sychrovský, David, et al.
Published: (2025)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
by: Tsuchiya, Taira
Published: (2025)

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

Regret Minimization in Stackelberg Games with Side Information
by: Harris, Keegan, et al.
Published: (2024)

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)

Convergence of Learning Dynamics in Stackelberg Games
by: Fiez, Tanner, et al.
Published: (2019)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
by: Liu, Junyan, et al.
Published: (2025)

A Learning Algorithm That Attains the Human Optimum in a Repeated Human-Machine Interaction Game
by: Isa, Jason T., et al.
Published: (2025)

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

Bayesian Learning in Episodic Zero-Sum Games
by: Yueh, Chang-Wei, et al.
Published: (2026)

Tight Regret Bounds for Bilateral Trade under Semi Feedback
by: Jin, Yaonan
Published: (2026)

Emergent specialization from participation dynamics and multi-learner retraining
by: Dean, Sarah, et al.
Published: (2022)

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

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

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

Corruption-Robust Offline Two-Player Zero-Sum Markov Games
by: Nika, Andi, et al.
Published: (2024)

GPU-Accelerated Counterfactual Regret Minimization
by: Kim, Juho
Published: (2024)

Regret Minimization and Convergence to Equilibria in General-sum Markov Games
by: Erez, Liad, et al.
Published: (2022)

Strategically Robust Multi-Agent Reinforcement Learning with Linear Function Approximation
by: Gonzales, Jake, et al.
Published: (2026)

Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
by: Ouhamma, Reda, et al.
Published: (2023)

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

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

Meta-Learning in Self-Play Regret Minimization
by: Sychrovský, David, et al.
Published: (2025)

Regret Minimization in Bilateral Trade With Perturbed Markets
by: Lunghi, Anna, et al.
Published: (2026)

Selling Joint Ads: A Regret Minimization Perspective
by: Aggarwal, Gagan, et al.
Published: (2024)

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

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

A Framework for Finding Local Saddle Points in Two-Player Zero-Sum Black-Box Games
by: Agarwal, Shubhankar, et al.
Published: (2025)

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
by: Bacchiocchi, Francesco, et al.
Published: (2025)

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

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