A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem

DOI10.1007/11889205_40zbMath1160.68566OpenAlexW2152431662MaRDI QIDQ3524258

Stephen F. Smith, Matthew J. Streeter

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889205_40

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Learning dynamic algorithm portfolios ⋮ Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models ⋮ Dynamic sample budget allocation in model-based optimization ⋮ BoostingTree: parallel selection of weak learners in boosting, with application to ranking ⋮ An analysis of model-based interval estimation for Markov decision processes ⋮ Multi-armed bandits with episode context

This page was built for publication: A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem