Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Regret Bounds for Restless Markov Bandits

9 references·1 citing·28 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
1979Bandit Processes and Dynamic Allocation Indices1,488 cited
2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
1988Restless bandits: activity allocation in a changing world1,174 cited
2010Near-optimal Regret Bounds for Reinforcement Learning718 cited
1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards358 cited
2004Minimax policies for adversarial and stochastic bandits330 cited
1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards110 cited

Cited by

2018Recharging Bandits30 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work