Competing in the dark: an efficient algorithm for bandit linear optimization
Online Convex Programming and Generalized Infinitesimal Gradient Ascent