Cover Image

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Tsuchiya, Taira
Format:	Preprint
Published:	2025
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

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
by: Ito, Shinji, et al.
Published: (2025)

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

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

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

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

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

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

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

Corrupted Learning Dynamics in Games
by: Tsuchiya, Taira, et al.
Published: (2024)

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

Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
by: Li, Yingru, et al.
Published: (2024)

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
by: Maiti, Arnab, et al.
Published: (2023)

Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade
by: Di Gregorio, Simone, et al.
Published: (2025)

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

Value Approximation for Two-Player General-Sum Differential Games with State Constraints
by: Zhang, Lei, et al.
Published: (2023)

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

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)

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

Two-Player Zero-Sum Differential Games with One-Sided Information
by: Ghimire, Mukesh, et al.
Published: (2025)

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

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

Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2024)

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

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024)

A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokerage
by: Bachoc, François, et al.
Published: (2025)

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

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

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

Fast Strategy Solving for the Informed Player in Two-Player Zero-Sum Linear-Quadratic Differential Games with One-Sided Information
by: Ghimire, Mukesh, et al.
Published: (2026)

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

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

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

Impact of Decentralized Learning on Player Utilities in Stackelberg Games
by: Donahue, Kate, et al.
Published: (2024)

ε-Optimally Solving Two-Player Zero-Sum POSGs
by: Escudie, Erwan Christian, et al.
Published: (2025)

A Lower Bound on Swap Regret in Extensive-Form Games
by: Daskalakis, Constantinos, et al.
Published: (2024)

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

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

Swap Regret and Correlated Equilibria Beyond Normal-Form Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025)

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

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)