42 citations · 52 across the 6 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.LG2011★ 1 cited
Efficient Online Learning for Opportunistic Spectrum Access
Wenhan Dai, Yi Gai, Bhaskar Krishnamachari
The problem of opportunistic spectrum access in cognitive radio networks has been recently formulated as a non-Bayesian restless multi-armed bandit problem. In this problem, there…
math.OC2011★ 1 cited
The Non-Bayesian Restless Multi-Armed Bandit: A Case of Near-Logarithmic Strict Regret
Wenhan Dai, Yi Gai, Bhaskar Krishnamachari +1
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A pla…