Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Glazebrook, K.
1983.
Optimal strategies for families of alternative bandit processes.
IEEE Transactions on Automatic Control,
Vol. 28,
Issue. 8,
p.
858.
Glazebrook, K. D.
1983.
Mathematical Learning Models — Theory and Algorithms.
Vol. 20,
Issue. ,
p.
68.
Gittins, J. C.
1983.
Mathematical Learning Models — Theory and Algorithms.
Vol. 20,
Issue. ,
p.
50.
Varaiya, P.
Walrand, J.
and
Buyukkoc, C.
1985.
Extensions of the multiarmed bandit problem: The discounted case.
IEEE Transactions on Automatic Control,
Vol. 30,
Issue. 5,
p.
426.
Kumar, P. R.
1985.
A Survey of Some Results in Stochastic Adaptive Control.
SIAM Journal on Control and Optimization,
Vol. 23,
Issue. 3,
p.
329.
Glazebrook, K. D.
1988.
On a reduction principle in dynamic programming.
Advances in Applied Probability,
Vol. 20,
Issue. 04,
p.
836.
Pilnick, S. E.
Glazebrook, K. D.
and
Gaver, D. P.
1991.
Optimal sequential replenishment of ships during combat.
Naval Research Logistics,
Vol. 38,
Issue. 5,
p.
637.
Glazebrook, K. D.
1991.
Competing Markov decision processes.
Annals of Operations Research,
Vol. 29,
Issue. 1,
p.
537.
Berninghaus, Siegfried
and
Seifert-Vogt, Hans G�nther
1991.
A temporary equilibrium model for international migration.
Journal of Population Economics,
Vol. 4,
Issue. 1,
p.
13.
McCall, Brian P.
1991.
A dynamic model of occupational choice.
Journal of Economic Dynamics and Control,
Vol. 15,
Issue. 2,
p.
387.
Glazebrook, K.D.
and
Gittins, J.C.
1993.
The performance of forwards induction policies.
Stochastic Processes and their Applications,
Vol. 46,
Issue. 2,
p.
301.
Asawa, M.
and
Teneketzis, D.
1994.
Multi-armed bandits with switching costs.
Vol. 1,
Issue. ,
p.
168.
Glazebrook, K.D.
1995.
Stochastic scheduling and forwards induction.
Discrete Applied Mathematics,
Vol. 57,
Issue. 2-3,
p.
145.
Glazebrook, K. D.
and
Owen, R. W.
1995.
Gittins-index heuristics for research planning.
Naval Research Logistics,
Vol. 42,
Issue. 7,
p.
1041.
Pandelis, D.G.
and
Teneketzis, D.
1995.
On the optimality of the Gittins index rule in multi-armed bandits with multiple plays.
Vol. 2,
Issue. ,
p.
1408.
Asawa, M.
and
Teneketzis, D.
1996.
Multi-armed bandits with switching penalties.
IEEE Transactions on Automatic Control,
Vol. 41,
Issue. 3,
p.
328.
Whittle, Peter
2002.
Applied Probability in Great Britain.
Operations Research,
Vol. 50,
Issue. 1,
p.
227.
Keller, Godfrey
and
Oldale, Alison
2003.
Branching bandits: a sequential search process with correlated pay-offs.
Journal of Economic Theory,
Vol. 113,
Issue. 2,
p.
302.
Ibarrola, Pilar
and
Vélez, Ricardo
2005.
Multi-armed Bandit processes with optimal selection of the operating times.
Test,
Vol. 14,
Issue. 1,
p.
239.
Brown, David B.
and
Smith, James E.
2013.
Optimal Sequential Exploration: Bandits, Clairvoyants, and Wildcats.
Operations Research,
Vol. 61,
Issue. 3,
p.
644.