Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T04:24:54.623Z Has data issue: false hasContentIssue false
  • English
  • Français

INDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYS

Published online by Cambridge University Press:  23 April 2010

Felipe Caro and
Onesun Steve Yoo
Felipe Caro
Affiliation:
UCLA Anderson School of Management Los Angeles, CA 90095, E-mail: fcaro@anderson.ucla.edu; onesun.yoo.2010@anderson.ucla.edu
Onesun Steve Yoo
Affiliation:
UCLA Anderson School of Management Los Angeles, CA 90095, E-mail: fcaro@anderson.ucla.edu; onesun.yoo.2010@anderson.ucla.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This article considers an important class of discrete time restless bandits, given by the discounted multiarmed bandit problems with response delays. The delays in each period are independent random variables, in which the delayed responses do not cross over. For a bandit arm in this class, we use a coupling argument to show that in each state there is a unique subsidy that equates the pulling and nonpulling actions (i.e., the bandit satisfies the indexibility criterion introduced by Whittle (1988). The result allows for infinite or finite horizon and holds for arbitrary delay lengths and infinite state spaces. We compute the resulting marginal productivity indexes (MPI) for the Beta-Bernoulli Bayesian learning model, formulate and compute a tractable upper bound, and compare the suboptimality gap of the MPI policy to those of other heuristics derived from different closed-form indexes. The MPI policy performs near optimally and provides a theoretical justification for the use of the other heuristics.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 24 , Issue 3 , July 2010, pp. 349 - 374
Copyright
Copyright © Cambridge University Press 2010

References

1.Altman, E. & Stidham, S., (1995). Optimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information source. Queueing Systems 21 (3-4): 267–291.CrossRefGoogle Scholar
2.Aviv, Y., Pazgal, A. (2002). Pricing of short life-cycle products through active learning. Working paper, Washington University, St. Louis, MO.Google Scholar
3.Bernardo, A., Chowdhry, B. (2002). Resources, real options, and corporate strategy. Journal of Financial Economics 63: 211–234.CrossRefGoogle Scholar
4.Bertsimas, D. & Mersereau, A.J. (2007). A learning approach for interactive marketing to a customer segment. Operations Reserach 55 (6): 1120–1135.CrossRefGoogle Scholar
5.Brezzi, M. & Lai, T.L. (2002). Optimal learning and experimentation in bandit problems. Journal of Economic Dynamics and Control 27: 87–108.CrossRefGoogle Scholar
6.Burnetas, A.N. & Katehakis, M.N. (2003). Asymptotic Bayes analysis for the finite-horizon one-armed-bandit problem. Probability in the Engineering and Informational Science 17:53–83.CrossRefGoogle Scholar
7.Caro, F. & Gallien, J. (2007). Dynamic sssortment with demand learning for seasonal consumer goods. Management Science, 53 (2): 276–292.CrossRefGoogle Scholar
8.DeGroot, M.H. (1970). Optimal statistical decisions. New York: McGraw-Hill.Google Scholar
9.Ehsan, N. & Liu, M. (2004). On the optimality of an index policy for bandwidth allocation with delayed state observation and differentiated services. In Proceedings INFOCOM 2004, Vol. 3, pp. 1974–1983.CrossRefGoogle Scholar
10.Eick, S.G. (1988). Gittins procedures for bandits with delayed responses. Journal of the Royal Statistics Society B 50 (1): 125–132.Google Scholar
11.Farias, V. & Madan, R. (2008). Irrevocable multi-armed bandit policies. Working paper. MIT Sloan School of Management.Google Scholar
12.Ginebra, J. & Clayton, M. K. (1995). Response surface bandits. Journal of the Royal Statistical Society B 57: 771–784.Google Scholar
13.Gittins, J.C. (1979). Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society B 14: 148–167.Google Scholar
14.Gittins, J.C. (1989). Multi-armed bandit allocation indices. Chichester, UK: John Wiley.Google Scholar
15.Hardwick, J., Oehmke, R., Stout, Q.F. (2006). New adaptive designs for delayed response models. Journal Sequential Planning Inference 136: 1940–1955.CrossRefGoogle Scholar
16.Kaplan, R.S. (1970). A dynamic inventory model with stochastic lead times. Management Science 16 (7): 491–507.CrossRefGoogle Scholar
17.Muharremoglu, A. & Yang, N. (2008). Inventory management with an exogenous supply process. Working Paper, Columbia University New York.Google Scholar
18.Niño-Mora, J. (2006). Dynamic priority allocation via restless bandit marginal productivity indices. Top 15: 161–198.CrossRefGoogle Scholar
19.Niño-Mora, J. (2007). Marginal productivity index policies for scheduling multiclass delay-/loss-sensitive traffic with delayed state observation. In NGI 2007, Proceedings of the 3rd EuroNGI conference on next generation Internet networks: design and engineering for heterogeneity. Piscataway, NJ:IEEE, pp. 209–217.CrossRefGoogle Scholar
20.Robinson, L.W., Bradley, J.R. & Thomas, L.J. (2001). Consequences of order crossover under order-up-to inventory policies. Manufacturing & Service Operations Management 3 (3): 175–188.CrossRefGoogle Scholar
21.Wang, X. & Bickis, M. (2003). One-armed bandit models with continuous and delayed responses. Mathematical Methods of Operations Research 58: 209–219.CrossRefGoogle Scholar
22.Weber, R.R. & Weiss, G. (1990). On an index policy for restless bandits. Journal of Applied Probability 27: 637–648.CrossRefGoogle Scholar
23.Weiss, G. (1992). Turnpike optimality of Smith's rule in parallel machines stochastic scheduling. Mathematics of Operations Research 17 (2): 255–270.CrossRefGoogle Scholar
24.Whittle, P. (1988). Restless bandits: Activity allocation in a changing world. Journal of Applied Probability 25A: 287–298.CrossRefGoogle Scholar