Learning and sharing in a changing world: Non-Bayesian restless bandit with multiple players

2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings

Volumn , Issue , 2011, Pages 240-246

  Liu, Haoyang ^a   Liu, Keqin ^a   Zhao, Qing ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION NETWORKS; DECENTRALIZED POLICIES; FINANCIAL INVESTMENTS; MARKOVIAN; RESTLESS BANDIT; RESTLESS MULTI-ARMED BANDIT;

INFORMATION THEORY; RANDOM PROCESSES;

INFORMATION DISSEMINATION;

EID: 79955764815     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2011.5743588     Document Type: Conference Paper

References (14)

1. T. Lai and H. Robbins, "Asymptotically Efficient Adaptive Allocation Rules," Advances in Applied Mathematics, Vol. 6, No. 1, pp. 4C22, 1985.
2. V. Anantharam, P. Varaiya, J. Walrand, "Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays-Part I: I.I.D. Rewards," IEEE Transaction on Automatic Control, Vol. AC-32 ,No.11 , pp. 968-976, Nov., 1987. (Pubitemid 18521625)
3. V. Anantharam, P. Varaiya, J. Walrand, "Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays-Part II: Markovian Rewards," IEEE Transaction on Automatic Control, Vol. AC- 32 ,No.11 ,pp. 977-982, Nov., 1987. (Pubitemid 18521626)
4. R. Agrawal, "Sample Mean Based Index Policies With O(log n) Regret for the Multi-armed Bandit Problem," Advances in Applied Probability, Vol. 27, pp. 1054C1078, 1995.
5. P. Auer, N. Cesa-Bianchi, P. Fischer, "Finite-time Analysis of the Multiarmed Bandit Problem," Machine Learning, 47, 235-256, 2002. (Pubitemid 34126111)
6. C. Tekin, M. Liu, "Online Algorithms for the Multi-Armed Bandit Problem With Markovian Rewards," Proc. of Allerton Conference on Communications, Control, and Computing, Sep., 2010.
7. K. Liu, Q. Zhao, "Distributed Learning in Multi-Armed Bandit with Multiple Players," IEEE Transations on Signal Processing, Vol. 58, No. 11, pp. 5667-5681, Nov. 2010.
8. A. Anandkumar, N. Michael, A.K. Tang, A. Swami "Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret," Submitted to IEEE JSAC on Advances in Cognitive Radio Networking and Communications.
9. H. Liu, K. Liu, Q. Zhao, "Logarithmic Weak Regret of Non-Bayesian Restless Multi-Armed Bandit," Proc. of Internanional Conference on Acoustics, Speech and Signal Processing (ICASSP), May, 2011.
10. P. Auer, N. Cesa-Bianchi, Y. Freund, R.E. Schapire "The nonstochastic multiarmed bandit problem," SIAM Journal on Computing, Vol. 32, pp. 48C77, 2002.
11. C. Papadimitriou, J. Tsitsiklis, "The Complexity of Optimal Queuing Network Control," Mathematics of Operations Research, Vol. 24, No. 2, pp. 293-305, May 1999.
12. C. Tekin, M. Liu, "Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach," Arxiv pre-print http://arxiv.org/abs/1010. 0056, Oct. 2010.
13. W. Dai, Y. Gai, B. Krishnamachari, Q. Zhao "The Non-Bayesian Restless Multi-armed Bandit: A Case Of Near-Logarithmic Regret," Proc. of Internanional Conference on Acoustics, Speech and Signal Processing (ICASSP), May, 2011.
14. D. Gillman, "A Chernoff Bound for Random Walks on Expander Graphs," Proc. 34th IEEE Symp. on Foundatioins of Computer Science(FOCS93),vol. SIAM J. Comp.,Vol. 27, No. 4, 1998.