Multi-armed Bandit Algorithms and Empirical EvaluationJoannès Vermorel, Mehryar Mohri2005-01-01otherLecture notes in computer science522 citationsclosedNo readable copy stored yet — this record is metadata only.Advanced Bandit Algorithms ResearchReinforcement Learning in RoboticsOptimization and Search ProblemsAbstractNo abstract was published for this record.Citations in this libraryStored only when both papers are in the corpus — 522 citations exist upstream.References2002Finite-time Analysis of the Multiarmed Bandit Problem1962Individual Choice Behavior2002The Nonstochastic Multiarmed Bandit Problem1952Some aspects of the sequential design of experiments2002Gambling in a rigged casino: The adversarial multi-armed bandit problemCited by2011Chasing a Moving Target: Exploitation and Exploration in Dynamic Environments2013Simultaneously Learning and Optimizing Using Controlled Variance Pricing2012The Knowledge Gradient Algorithm for a General Class of Online Learning Problems2021Knapsack Based Optimal Policies for Budget–Limited Multi–Armed Bandits2021Children are more exploratory and learn more than adults in an approach-avoid task2010Solving two‐armed Bernoulli bandit problems using a Bayesian learning automaton2010An Asymptotically Optimal Bandit Algorithm for Bounded Support Models.2014Efficient crowdsourcing of unknown experts using bounded multi-armed bandits