16 citations · 58 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of users and reso…
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…
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…