"A dynamic programming strategy to balance exploration and exploitation in ..."

Olivier Caelen, Gianluca Bontempi (2010)

> Home

Details and statistics

DOI: 10.1007/S10472-010-9190-1

access: closed

type: Journal Article

metadata version: 2019-09-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amai/CaelenB10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/CaelenB10
Olivier Caelen, Gianluca Bontempi:
A dynamic programming strategy to balance exploration and exploitation in the bandit problem. Ann. Math. Artif. Intell. 60(1-2): 3-24 (2010)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.