• Publications
  • Influence

  • Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire
  • Computer Science, Mathematics
  • Proceedings of IEEE 36th Annual Foundations of…
  • 1995 (First Publication: 23 October 1995)
  • In the multi-armed bandit problem, a gambler must decide which arm of K non-identical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has receivedContinue Reading
  • Nicolò Cesa-Bianchi, Gábor Lugosi
  • Mathematics, Computer Science
  • COLT
  • 2009 (First Publication: 1 September 2012)
  • We study sequential prediction problems in which, at each time instance, the forecaster chooses a vector from a given finite set [email protected]?R^d. At the same time, the opponent chooses aContinue Reading
  • Sébastien Bubeck, Nicolò Cesa-Bianchi, Gábor Lugosi
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 2013 (First Publication: 8 September 2012)
  • The stochastic multiarmed bandit problem is well understood when the reward distributions are sub-Gaussian. In this paper, we examine the bandit problem under the weaker assumption that theContinue Reading