메뉴 건너뛰기




Volumn 45, Issue 4, 2000, Pages 711-714

Finite-time lower bounds for the two-armed bandit problem

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; CHEBYSHEV APPROXIMATION; INTEGRAL EQUATIONS; NORMAL DISTRIBUTION; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; THEOREM PROVING;

EID: 0034171759     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.847107     Document Type: Article
Times cited : (18)

References (9)
  • 1
    • 0024089489 scopus 로고
    • Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost
    • Oct.
    • R. Agrawal, M. Hedge, and D. Teneketzis, "Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost," IEEE Trans. Automat. Contr., vol. 33, pp. 899-906, Oct. 1988.
    • (1988) IEEE Trans. Automat. Contr. , vol.33 , pp. 899-906
    • Agrawal, R.1    Hedge, M.2    Teneketzis, D.3
  • 2
    • 0024626787 scopus 로고
    • Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: Finite parameter space
    • Mar.
    • R. Agrawal, D. Teneketzis, and V. Anantharam, "Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: Finite parameter space," IEEE Trans. Automat. Contr., vol. 34, pp. 258-266, Mar. 1989.
    • (1989) IEEE Trans. Automat. Contr. , vol.34 , pp. 258-266
    • Agrawal, R.1    Teneketzis, D.2    Anantharam, V.3
  • 3
    • 0023453059 scopus 로고
    • Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays - Part I: i.i.d. rewards
    • Nov.
    • V. Anantharam, P. Varaiya, and J. Walrand, "Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays - Part I: i.i.d. rewards," IEEE Trans. Automat. Contr., vol. 32, pp. 968-976, Nov. 1987.
    • (1987) IEEE Trans. Automat. Contr. , vol.32 , pp. 968-976
    • Anantharam, V.1    Varaiya, P.2    Walrand, J.3
  • 4
    • 0023450663 scopus 로고
    • Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays - Part II: Markovian rewards
    • Nov.
    • _, "Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays - Part II: Markovian rewards," IEEE Trans. Automat. Contr., vol. 32, no. 11, pp. 977-982, Nov. 1987.
    • (1987) IEEE Trans. Automat. Contr. , vol.32 , Issue.11 , pp. 977-982
  • 7
    • 0002899547 scopus 로고
    • Asymptotically efficient adaptive allocation rules
    • T. L. Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules," Advances Appl. Math., vol. 6, pp. 4-22, 1985.
    • (1985) Advances Appl. Math. , vol.6 , pp. 4-22
    • Lai, T.L.1    Robbins, H.2
  • 8
    • 84966203785 scopus 로고
    • Some aspects of the sequential design of experiments
    • H. Robbins, "Some aspects of the sequential design of experiments," Bull. Amer. Math. Soc., vol. 58, pp. 527-535, 1952.
    • (1952) Bull. Amer. Math. Soc. , vol.58 , pp. 527-535
    • Robbins, H.1
  • 9
    • 0001395850 scopus 로고
    • On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
    • W. R. Thompson, "On the likelihood that one unknown probability exceeds another in view of the evidence of two samples," Biometrika, vol. 25, pp. 275-294, 1933.
    • (1933) Biometrika , vol.25 , pp. 275-294
    • Thompson, W.R.1


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