A dynamic programming strategy to balance exploration and exploitation in the bandit problem
type: Item
instance of: scholarly article
title: A dynamic programming strategy to balance exploration and exploitation in the bandit problem
zbMATH Open document ID: 1226.68079
author: Olivier Caelen
author: Gianluca Bontempi
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2011-11-23T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 62H12
zbMATH DE Number: 5977712
zbMATH Keywords: multi-armed bandit problem
zbMATH Keywords: greedy
zbMATH Keywords: estimation
describes a project that uses: bootstrap
describes a project that uses: PRMLT
MaRDI profile type: Publication
full work available at URL: s10472-010-9190-1
OpenAlex ID: W2052471706
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: Q4252717
cites work: Q3795523
cites work: Q4257216
cites work: Q5483032
cites work: Q4318617
cites work: Q4692329
cites work: The sample average approximation method for stochastic discrete optimization
cites work: Exploration of multi-state environments: Local measures and back-propagation of uncertainty
cites work: Approximate Dynamic Programming
cites work: Q4315289
cites work: Some aspects of the sequential design of experiments
DOI: 10.1007/S10472-010-9190-1
description: scientific article; zbMATH DE number 5977712