메뉴 건너뛰기




Volumn , Issue , 2010, Pages 3010-3013

Distributed learning in cognitive radio networks: Multi-armed bandit with distributed multiple players

Author keywords

Cognitive radios; Decentralized multi armed bandit; Opportunistic spectrum access; Order optimal policy

Indexed keywords

BENCHMARKING; MULTI AGENT SYSTEMS; RADIO SYSTEMS; RANDOM PROCESSES; STOCHASTIC SYSTEMS; WIDE AREA NETWORKS;

EID: 78049402595     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2010.5496131     Document Type: Conference Paper
Times cited : (50)

References (7)
  • 1
    • 0002899547 scopus 로고
    • Asymptotically efficient adaptive allocation rules
    • T. Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules," Advances in Applied Mathematics, vol. 6, no. 1, pp. 4C22, 1985.
    • (1985) Advances in Applied Mathematics , vol.6 , Issue.1 , pp. 4-22
    • Lai, T.1    Robbins, H.2
  • 2
    • 0023453059 scopus 로고
    • Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays-Part I: IID rewards
    • V. Anantharam, P. Varaiya, and J. Walrand, "Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays-Part I: IID rewards," IEEE Tran. on Auto. Control, vol. 32, no. 11, pp. 968C976, 1987.
    • (1987) IEEE Tran. on Auto. Control , vol.32 , Issue.11 , pp. 968-976
    • Anantharam, V.1    Varaiya, P.2    Walrand, J.3
  • 5
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time Analysis of the Multiarmed Bandit Problem
    • P. Auer, N. Cesa-Bianchi, P. Fischer, "Finite-time Analysis of the Multiarmed Bandit Problem," Machine Learning, Vol. 47, pp. 235-256, 2002.
    • (2002) Machine Learning , vol.47 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3


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