2018
Let’s be Honest: An Optimal No-Regret Framework for Zero-Sum Games
ICML 2018oral
We revisit the problem of solving two-player zero-sum games in the decentralized setting. We propose a simple algorithmic framework that simultaneously achieves the best rates for honest regret as well as adversarial regret, and in addition resolves the open problem of removing the logarithmic terms…