![Algorithms and Uncertainty_small text_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Algorithms%20and%20Uncertainty_hi-res_1.jpg?h=6dcb57f1&itok=7LxcepO0)
Abstract
What is the computational power of best-response computations in repeated game playing? I will give a precise answer to this question in the context of no-regret learning in zero-sum games, and discuss the implications within the theory of online learning and regret minimization.
Based on joint work with Elad Hazan (STOC'16).