A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs
暂无分享,去创建一个
[1] Max-Olivier Hongler,et al. Optimal hysteresis for a class of deterministic deteriorating two-armed Bandit problem with switching costs , 2003, Autom..
[2] D. Teneketzis,et al. Optimal stochastic scheduling of forest networks with switching penalties , 1994, Advances in Applied Probability.
[3] José Niño-Mora,et al. Dynamic priority allocation via restless bandit marginal productivity indices , 2007, 2304.06115.
[4] José Niòo-Mora. A (2/3)n3 Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain , 2007 .
[5] Tackseung Jun. A survey on the bandit problem with switching costs , 2004 .
[6] J. Niño-Mora. RESTLESS BANDITS, PARTIAL CONSERVATION LAWS AND INDEXABILITY , 2001 .
[7] J. Niño-Mora. Computing an index policy for bandits with switching penalties , 2007, Valuetools 2007.
[8] J. Banks,et al. Switching Costs and the Gittins Index , 1994 .
[9] J. Nio-Mora. Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues , 2006 .
[10] José Niño-Mora,et al. Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach , 2002, Math. Program..
[11] D. Teneketzis,et al. Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost , 1988 .
[12] Demosthenis Teneketzis,et al. Multi-armed bandits with switching penalties , 1996, IEEE Trans. Autom. Control..
[13] Lawrence M. Wein,et al. Dynamic Scheduling of a Two-Class Queue with Setups , 2011, Oper. Res..
[14] J. Gittins. Bandit processes and dynamic allocation indices , 1979 .
[15] P. Whittle. Restless bandits: activity allocation in a changing world , 1988, Journal of Applied Probability.
[16] Jean Walrand,et al. Extensions of the multiarmed bandit problem: The discounted case , 1985 .