research
∙
04/20/2012
Regret in Online Combinatorial Optimization
We address online linear optimization problems when the possible actions...
share
research
∙
12/16/2011
Regret lower bounds and extended Upper Confidence Bounds policies in stochastic multi-armed bandit problem
This paper is devoted to regret lower bounds in the classical model of s...
research
∙
07/22/2011
Robustness of Anytime Bandit Policies
This paper studies the deviations of the regret in a stochastic multi-ar...
research
∙
05/24/2011
