Dynamic Allocation Problems in Continuous Time
Karoui, Nicole El ; Karatzas, Ioannis
Ann. Appl. Probab., Tome 4 (1994) no. 4, p. 255-286 / Harvested from Project Euclid
We present an approach to the general, non-Markovian dynamic allocation (or multiarmed bandit) problem, formulated in continuous time as a problem of stochastic control for multiparameter processes in the manner of Mandelbaum. This approach is based on a direct, martingale study of auxiliary questions in optimal stopping. Using a methodology similar to that of Whittle and relying on simple time-change arguments, we construct Gittins-index-type strategies, verify their optimality, provide explicit expressions for the values of dynamic allocation and associated optimal stopping problems, explore interesting dualities and derive various characterizations of Gittins indices. This paper extends results of our recent work on discrete-parameter dynamic allocation to the continuous time setup; it can be read independently of that work.
Publié le : 1994-05-14
Classification:  Multiarmed bandit problem,  optimal stopping,  stochastic control,  multiparameter random time-change,  Gittins index,  Brownian local time,  93E20,  60G60,  60G40,  90B85,  62L10
@article{1177005062,
     author = {Karoui, Nicole El and Karatzas, Ioannis},
     title = {Dynamic Allocation Problems in Continuous Time},
     journal = {Ann. Appl. Probab.},
     volume = {4},
     number = {4},
     year = {1994},
     pages = { 255-286},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1177005062}
}
Karoui, Nicole El; Karatzas, Ioannis. Dynamic Allocation Problems in Continuous Time. Ann. Appl. Probab., Tome 4 (1994) no. 4, pp.  255-286. http://gdmltest.u-ga.fr/item/1177005062/