Optimal hysteresis for a class of deterministic deteriorating two-armed Bandit problem with switching costs

Automatica

Volumn 39, Issue 11, 2003, Pages 1947-1955

  Dusonchet, F ^a   Hongler, M O ^a  

^a EPFL   (Switzerland)

Author keywords

Hysteretic policy; Multi armed Bandit process; Optimal switching curves; Priority index policy; Switching costs

Indexed keywords

COSTS; DELAY CIRCUITS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PROBLEM SOLVING; SET THEORY;

MULTI-ARMED BANDIT PROCESSES;

SWITCHING THEORY;

EID: 0141865677     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(03)00203-6     Document Type: Article

References (10)

1. Asawa M., Teneketzis D. Multi-armed bandits with switching penalties. IEEE Transactions on Automatic Control. 41:1996;328-348.
2. Banks J.S., Sundaram R.K. Switching cost and Gittin's index. Econometrica. 62:1994;687-694.
3. Dusonchet, F., & Hongler, M.-O. (2002). Multi-armed Bandits with switching costs and the Gittins index. Preprint EPFL-IPR-LPM.
4. Gittins J.C. Multi-armed Bandits allocation indices. 1989;Wiley, New York.
5. Gittins, J. C., & Jones, D. M. (1974). A dynamic allocation index for the sequential design of experiments. In J. Gani (Ed.), Progress in Statistics (pp. 241-266). Amsterdam: North-Holland.
6. Ha A. Optimal dynamic scheduling policy for a make-to-stock production system. Operation Research. 45:1997;42-54.
7. Kaspi, H. (2002). Two-armed Bandits with switching costs. Preprint Technion.
8. Van Oyen M.P., Teneketzis D. Optimal stochastic scheduling of forest networks with switching penalities. Adv. Appl. Probab. 26:1994;474-497.
9. Walrand J. An Introduction to Queueing Network. 1988;Prentice-Hall, Englewood Cliffs, NJ.
10. Whittle P. Optimization over time. Dynamic Programming and Stochastic Control. 1982;Wiley, New York.