16 citations · 34 across the 3 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2010★ 4 cited
The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic 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…
math.OC2010★ 14 cited
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
Yi Gai, Bhaskar Krishnamachari, Rahul Jain
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int…