메뉴 건너뛰기




Volumn 27, Issue 1, 2002, Pages 87-108

Optimal learning and experimentation in bandit problems

Author keywords

Corrected binomial algorithm; Incomplete learning; Multi armed bandits; Optimal stopping; Switching costs

Indexed keywords


EID: 0036334330     PISSN: 01651889     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1889(01)00028-8     Document Type: Article
Times cited : (87)

References (24)
  • 5
    • 0009908139 scopus 로고    scopus 로고
    • Optimal stopping for Brownian motion in bandit problems and sequential analysis
    • Working Paper, Department of Statistics, Stanford University
    • (1999)
    • Brezzi, M.1    Lai, T.L.2
  • 12
    • 84891584370 scopus 로고
    • Multi-Armed Bandit Allocation Indices
    • Wiley, New York
    • (1989)
    • Gittins, J.C.1
  • 18
    • 0000678581 scopus 로고
    • On some asymptotic properties of maximum likelihood estimates and related Bayes estimates
    • University of California Publications in Statistics
    • (1953) , vol.1 , pp. 277-330
    • LeCam, L.1
  • 24
    • 4243581398 scopus 로고
    • Asymptotically optimal sequential tests of linear hypotheses in multiparameter exponential families
    • Ph.D. Dissertation, Department of Statistics, Stanford University
    • (1992)
    • Zhang, L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.