On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games Under Noisy Feedback
- 1 September 2025
- book chapter
- Published by Springer Nature
- p. 3-20
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Near-Optimal Regret Bounds for Thompson SamplingJournal of the ACM, 2017
- Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis2012
- Near-Optimal No-Regret Algorithms for Zero-Sum Games2011
- On Minmax Theorems for Multiplayer Games2011
- Prediction, Learning, and Games2006
- Finite-time Analysis of the Multiarmed Bandit ProblemMachine Learning, 2002
- Adaptive Game Playing Using Multiplicative WeightsGames and Economic Behavior, 1999