← Search

Maxwell Fishelson

2 accepted papers

2021

Near-Optimal No-Regret Learning in General Games

NeurIPS 2021oral

We show that Optimistic Hedge -- a common variant of multiplicative-weights-updates with recency bias -- attains ${\rm poly}(\log T)$ regret in multi-player general-sum games. In particular, when every player of the game uses Optimistic Hedge to iteratively update her action in response to the histo…

Cited by 130SourcePDFScholar