multi-armed bandit

Thompson Sampling for Complex Online Problems ICML 2014 Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014 Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem COLT 2013 Adaptive Submodular Maximization in Bandit Setting NeurIPS 2013 A Gang of Bandits NeurIPS 2013 Almost Optimal Exploration in Multi-Armed Bandits ICML 2013 A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013 Beating Bandits in Gradually Evolving Worlds COLT 2013 Bounded regret in stochastic multi-armed bandits COLT 2013 Distributed Exploration in Multi-Armed Bandits NeurIPS 2013 Eluder Dimension and the Sample Complexity of Optimistic Exploration NeurIPS 2013 Estimation Bias in Multi-Armed Bandit Algorithms for Search Advertising NeurIPS 2013 Exploration vs Exploitation vs Safety: Risk-Aware Multi-Armed Bandits ACML 2013 Forgetful Bayes and myopic planning: Human learning and decision-making in a bandit setting NeurIPS 2013 From Bandits to Experts: A Tale of Domination and Independence NeurIPS 2013 Further Optimal Regret Bounds for Thompson Sampling AISTATS 2013 Generic Exploration and K-armed Voting Bandits ICML 2013 Gossip-based distributed stochastic bandit algorithms ICML 2013 High-Dimensional Gaussian Process Bandits NeurIPS 2013 Information Complexity in Bandit Subset Selection COLT 2013 Large-Scale Bandit Problems and KWIK Learning ICML 2013 Lower Bounds and Selectivity of Weak-Consistent Policies in Stochastic Multi-Armed Bandit Problem JMLR 2013 Multi-armed Bandit Problem with Lock-up Periods ACML 2013 Multiple Identifications in Multi-Armed Bandits ICML 2013 (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings NeurIPS 2013