Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Algorithms for Adversarial Bandit Problems with Multiple Plays

7 references·4 citing·38 second hop

FromToDepth

this work references cited by second hop

References

2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards358 cited
2007Multi-Armed Bandit Problems188 cited
2008Competing in the dark: An efficient algorithm for bandit linear optimization182 cited
2007The on-line shortest path problem under partial monitoring151 cited
1961Mathematical Methods of Operations Research.120 cited
1999On the optimality of the Gittins index rule for multi-armed bandits with multiple plays78 cited

Cited by

2013Ranked bandits in metric spaces: learning diverse rankings over large document collections63 cited
2010Non-Stochastic Bandit Slate Problems61 cited
2011Minimax Policies for Combinatorial Prediction Games50 cited
2018Budget-Constrained Multi-Armed Bandits With Multiple Plays45 cited

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