no code implementations • 31 Jul 2014 • Walid Krichene, Benjamin Drighès, Alexandre M. Bayen
We show that strong convergence can be guaranteed for a class of algorithms with a vanishing upper bound on discounted regret, and which satisfy an additional condition.
