Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs

14 references·1 citing·41 second hop

FromToDepth

this work references cited by second hop

References

1979Bandit Processes and Dynamic Allocation Indices1,488 cited
1988Restless bandits: activity allocation in a changing world1,174 cited
1985Extensions of the multiarmed bandit problem: The discounted case278 cited
2001Restless bandits, partial conservation laws and indexability202 cited
2007Dynamic priority allocation via restless bandit marginal productivity indices136 cited
1994Switching Costs and the Gittins Index125 cited
1988Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost112 cited
2002Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach97 cited
1998Dynamic Scheduling of a Two-Class Queue with Setups89 cited
2004A survey on the bandit problem with switching costs88 cited
1996Multi-armed bandits with switching penalties82 cited
2006Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-StockM/G/1Queues54 cited
2007A (2/3) n 3 Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain40 cited
1994Optimal stochastic scheduling of forest networks with switching penalties35 cited

Cited by

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

2023Markovian Restless Bandits and Index Policies: A Review24 cited