← Back to papers

2025 COLT COLT 2025

Open Problem: Optimal Instance-Dependent Sample Complexity for finding Nash Equilibrium in Two Player Zero-Sum Matrix games

Authors

Arnab Maiti

Related papers

Of Dice and Games: A Theory of Generalized Boosting 2025

Is a Good Foundation Necessary for Efficient Reinforcement Learning? The Computational Role of the Base Model in Exploration 2025

Computing Optimal Regularizers for Online Linear Optimization 2025

Learning Mixtures of Gaussians Using Diffusion Models 2025

On the query complexity of sampling from non-log-concave distributions (extended abstract) 2025