메뉴 건너뛰기




Volumn 29, Issue 4, 2011, Pages 731-745

Distributed algorithms for learning and cognitive medium access with logarithmic regret

Author keywords

Cognitive medium access control; distributed algorithms; logarithmic regret; multi armed bandits

Indexed keywords

ACCESS DECISION; ACCESS POLICIES; CHANNEL ACCESS; COGNITIVE MEDIUM ACCESS CONTROL; COGNITIVE NETWORK; DISTRIBUTED ALGORITHM; DISTRIBUTED ALGORITHMS; DISTRIBUTED LEARNING; EXPLICIT INFORMATION; LOGARITHMIC REGRET; LOWER BOUNDS; MEDIUM ACCESS; MULTI ARMED BANDIT; OPTIMAL REGRET; SELF-PLAY; SYSTEM THROUGHPUT;

EID: 79953194834     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2011.110406     Document Type: Article
Times cited : (346)

References (25)
  • 2
    • 85032751060 scopus 로고    scopus 로고
    • A survey of dynamic spectrum access
    • DOI 10.1109/MSP.2007.361604
    • Q. Zhao and B. Sadler, "A Survey of Dynamic Spectrum Access," IEEE Signal Proc. Mag., vol. 24, no. 3, pp. 79-89, 2007. (Pubitemid 46840190)
    • (2007) IEEE Signal Processing Magazine , vol.24 , Issue.3 , pp. 79-89
    • Zhao, Q.1    Sadler, B.M.2
  • 4
    • 79953229444 scopus 로고    scopus 로고
    • Decentralized multi-armed bandit with multiple distributed players
    • submitted to Oct.
    • K. Liu and Q. Zhao, "Decentralized Multi-Armed Bandit with Multiple Distributed Players," submitted to IEEE Trans. Signal Process., Oct. 2009.
    • (2009) IEEE Trans. Signal Process
    • Liu, K.1    Zhao, Q.2
  • 5
    • 0037403569 scopus 로고    scopus 로고
    • A markov-based channel model algorithm for wireless networks
    • A. Konrad, B. Zhao, A. Joseph, and R. Ludwig, "A Markov-based channel model algorithm for wireless networks," Wireless Networks, vol. 9, no. 3, pp. 189-199, 2003.
    • (2003) Wireless Networks , vol.9 , Issue.3 , pp. 189-199
    • Konrad, A.1    Zhao, B.2    Joseph, A.3    Ludwig, R.4
  • 6
    • 38149010624 scopus 로고    scopus 로고
    • Cognitive medium access: Constraining interference based on experimental models
    • S. Geirhofer, L. Tong, and B. Sadler, "Cognitive Medium Access: Constraining Interference Based on Experimental Models," IEEE J. Sel. Areas Commun., vol. 26, no. 1, p. 95, 2008.
    • (2008) IEEE J. Sel. Areas Commun. , vol.26 , Issue.1 , pp. 95
    • Geirhofer, S.1    Tong, L.2    Sadler, B.3
  • 7
    • 0023450663 scopus 로고
    • Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-part II: Markovian rewards
    • V. Anantharam, P. Varaiya, and J. Walrand, "Asymptotically Efficient Allocation Rules for the Multiarmed Bandit Problem with Multiple Plays-Part II: Markovian Rewards," IEEE Tran. Autom. Control, vol. 32, no. 11, pp. 977-982, 1987. (Pubitemid 18521626)
    • (1987) IEEE Transactions on Automatic Control , vol.AC-32 , Issue.11 , pp. 977-982
    • Anantharam, V.1    Varaiya, P.2    Walrand, J.3
  • 8
    • 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. 4-22, 1985.
    • (1985) Advances in Applied Mathematics , vol.6 , Issue.1 , pp. 4-22
    • Lai, T.1    Robbins, H.2
  • 9
    • 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. Autom. Control, vol. 32, no. 11, pp. 968-976, 1987. (Pubitemid 18521625)
    • (1987) IEEE Transactions on Automatic Control , vol.AC-32 , Issue.11 , pp. 968-976
    • Anantharam, V.1    Varaiya, P.2    Walrand, J.3
  • 10
    • 0000616723 scopus 로고
    • Sample mean based index policies with O(log n) regret for the multi-armed bandit problem
    • R. Agrawal, "Sample Mean Based Index Policies with O(log n) Regret for the Multi-Armed Bandit Problem," Advances in Applied Probability, vol. 27, no. 4, pp. 1054-1078, 1995.
    • (1995) Advances in Applied Probability , vol.27 , Issue.4 , pp. 1054-1078
    • Agrawal, R.1
  • 11
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multiarmed bandit problem
    • DOI 10.1023/A:1013689704352, Computational Learning Theory
    • P. Auer, N. Cesa-Bianchi, and P. Fischer, "Finite-time Analysis of the Multiarmed Bandit Problem," Machine Learning, vol. 47, no. 2, pp. 235-256, 2002. (Pubitemid 34126111)
    • (2002) Machine Learning , vol.47 , Issue.2-3 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 13
    • 52049120549 scopus 로고    scopus 로고
    • A restless bandit formulation of opportunistic access: Indexablity and index policy
    • Submitted available on Arxiv
    • K. Liu and Q. Zhao, "A restless bandit formulation of opportunistic access: Indexablity and index policy," Submitted IEEE Trans. Inf. Theory, available on Arxiv, 2008.
    • (2008) IEEE Trans. Inf. Theory
    • Liu, K.1    Zhao, Q.2
  • 14
    • 50249162574 scopus 로고    scopus 로고
    • Cooperation and Learning in multiuser opportunistic spectrum access
    • Beijing, China May
    • H. Liu, B. KrishnaMAChari, and Q. Zhao, "Cooperation and Learning in multiuser opportunistic spectrum access," in IEEE Intl. Conf. on Comm. (ICC), Beijing, China, May 2008.
    • (2008) IEEE Intl. Conf. on Comm. (ICC)
    • Liu, H.1    Krishna, B.2    Chari, M.A.3    Zhao, Q.4
  • 15
    • 66149152720 scopus 로고    scopus 로고
    • Learning to compete for resources in wireless stochastic games
    • May
    • F. Fu and M. van der Schaar, "Learning to compete for resources in wireless stochastic games," IEEE Trans. Veh. Technol., vol. 58, no. 4, pp. 1904-1919, May 2009.
    • (2009) IEEE Trans. Veh. Technol. , vol.58 , Issue.4 , pp. 1904-1919
    • Fu, F.1    Van Der Schaar, M.2
  • 18
    • 74949099926 scopus 로고    scopus 로고
    • Multi-agent Q-learning of channel selection in multi-user cognitive radio systems: A two by two case
    • Istanbul, Turkey
    • H. Li, "Multi-agent Q-Learning of Channel Selection in Multi-user Cognitive Radio Systems: A Two by Two Case," in IEEE Conf. on System, Man and Cybernetics, Istanbul, Turkey, 2009.
    • (2009) IEEE Conf. on System, Man and Cybernetics
    • Li, H.1
  • 19
    • 84889972802 scopus 로고    scopus 로고
    • Game theoretic learning and pricing for dynamic spectrum access in cognitive radio
    • Springer
    • M. Maskery, V. Krishnamurthy, and Q. Zhao, "Game Theoretic Learning and Pricing for Dynamic Spectrum Access in Cognitive Radio," in Cognitive Wireless Comm. Networks. Springer, 2007.
    • (2007) Cognitive Wireless Comm. Networks
    • Maskery, M.1    Krishnamurthy, V.2    Zhao, Q.3
  • 20
    • 71049137803 scopus 로고    scopus 로고
    • Multiplicative updates outperform generic no-regret learning in congestion games
    • Bethesda, MD May-June
    • R. Kleinberg, G. Piliouras, and E. Tardos, "Multiplicative Updates Outperform Generic No-regret Learning in Congestion Games," in Proc. ACM Symp. on theory of computing (STOC), Bethesda, MD, May-June 2009.
    • (2009) Proc. ACM Symp. on theory of computing (STOC)
    • Kleinberg, R.1    Piliouras, G.2    Tardos, E.3
  • 21
    • 77953180719 scopus 로고    scopus 로고
    • Learning multiuser channel allocations in cognitive radio networks: A combinatorial multi- armed bandit formulation
    • Singapore, April
    • Y. Gai, B. KrishnaMAChari, and R. Jain, "Learning Multiuser Channel Allocations in Cognitive Radio Networks: A Combinatorial Multi- Armed Bandit Formulation," in IEEE Symp. on Dynamic Spectrum Access Networks (DySPAN), Singapore, April 2010.
    • (2010) IEEE Symp. on Dynamic Spectrum Access Networks (DySPAN)
    • Gai, Y.1    Krishna, B.2    Chari, M.A.3    Jain, R.4


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