Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Finite-time lower bounds for the two-armed bandit problem

6 references·1 citing·21 second hop

FromToDepth

this work references cited by second hop

References

1952Some aspects of the sequential design of experiments2,183 cited
1990Multi-Armed Bandit Allocation Indices.997 cited
1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards358 cited
1989Multi-Armed Bandit Allocation Indices280 cited
1988Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost112 cited
1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards110 cited

Cited by

2012Active Model Selection52 cited

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