Regret of Multi-Channel Bandit Game in Cognitive Radio Networks
The problem of how to evaluate the rate of convergence to Nash equilibrium solutions in the process of channel selection under incomplete information is studied. In this paper, the definition of regret is used to reflect the convergence rates of online algorithms. The process of selecting an idle ch...
Main Authors: | Ma Jun, Zhang Yonghong |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2016-01-01
|
Series: | MATEC Web of Conferences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1051/matecconf/20165605002 |
Similar Items
-
Study of Multi-Armed Bandits for Energy Conservation in Cognitive Radio Sensor Networks
by: Juan Zhang, et al.
Published: (2015-04-01) -
Decentralized Blind Spectrum Selection in Cognitive Radio Networks Considering Handoff Cost
by: Yongqun Chen, et al.
Published: (2017-03-01) -
Minimizing Regret in Combinatorial Bandits and Reinforcement Learning
by: Talebi Mazraeh Shahi, Mohammad Sadegh
Published: (2017) -
Multi-Armed Bandit Channel Access Scheme With Cognitive Radio Technology in Wireless Sensor Networks for the Internet of Things
by: Jiang Zhu, et al.
Published: (2016-01-01) -
Multi-armed bandits with unconventional feedback
by: Gajane, Pratik
Published: (2017)