10 citations · 28 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 8 cited
Logarithmic regret bounds for Bandits with Knapsacks
Arthur Flajolet, Patrick Jaillet
Optimal regret bounds for Multi-Armed Bandit problems are now well documented. They can be classified into two categories based on the growth rate with respect to the time horizon…
cs.DS2014
Robust Adaptive Routing Under Uncertainty
Arthur Flajolet, Sebastien Blandin, Patrick Jaillet
We consider the problem of finding an optimal history-dependent routing strategy on a directed graph weighted by stochastic arc costs when the objective is to minimize the risk of…