241 citations · 861 across the 54 of their papers we have counts for
Showing 2010 · math.OCShow all
3 papers · 2 filters
math.OC2010★ 10 cited
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…
math.OC2010★ 1 cited
Online Learning in Opportunistic Spectrum Access: A Restless Bandit Approach
Cem Tekin, Mingyan Liu
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activities…
math.OC2010★ 9 cited
Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards
Cem Tekin, Mingyan Liu
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th…