Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management

References

• Crosbie J. H., Glazebrook K. D. Index policies and a novel performance space structure for a class of generalized branching bandit problems. Math. Oper. Res. (2000) 25:281–297Link, Google Scholar
• Denardo E. V. Contraction mappings in the theory underlying dynamic programming. SIAM Rev. (1968) 9:165–177Crossref, Google Scholar
• Denardo E. V., Rothblum U. G., Park H. Index policies for a multi-armed bandit problem with exponential utility. (2004) . ForthcomingGoogle Scholar
• El Karoui N., Karatzas I. General Gittins' index processes in discrete time. Proc. Natl. Acad. Sci. USA (1993) 90:1232–1236Crossref, Google Scholar
• Gittins J. C., Jones D. M., Gani J., Sarkadu K., Vince I. A dynamic allocation index for the sequential design experiments. Progress in Statistics (1974) (North Holland, Amsterdam, The Netherlands) 241–266European Meeting of Statisticians IGoogle Scholar
• Glazebrook K. D. Stochastic scheduling with order constraints. Internat. J. Systems Sci. (1976) 7:657–666Crossref, Google Scholar
• Granot D., Zuckerman D. Optimal sequencing and resource allocation in research and development projects. Management Sci. (1991) 37:140–156Link, Google Scholar
• Howard R. S., Matheson J. E. Risk-sensitive Markov decision problems. Management Sci. (1972) 8:356–369Link, Google Scholar
• Kallenberg L. C. M. A note on M. N. Katehakis and Y. R. Chen's computation of the Gittins index. Math. Oper. Res. (1986) 12:184–186Link, Google Scholar
• Kaspi H., Mandelbaum A. Multi-armed bandits in discrete and continuous time. Ann. Appl. Probab. (1998) 8:1270–1290Crossref, Google Scholar
• Katehakis M. N., Veinott A. F. The multi-armed bandit problem: Decomposition and computation. Math. Oper. Res. (1987) 12:262–268Link, Google Scholar
• Lynn G. S., Morone J. G., Paulson A. S. Marketing and discontinuous innovation: The probe and learn process. California Management Rev. (1996) 38:8–37Crossref, Google Scholar
• Nash P. Optimal Allocation of Resources Between Research Projects. (1973) . Ph.D. thesis, Cambridge University, Cambridge, U.K.Google Scholar
• Pinedo M.Scheduling: Theory, Algorithms and Systems (2002) 2nd ed.(Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Rothblum U. G., Van der Heyden L. Optimal search in an arborescence with an application to the scheduling of multi-component R&D projects. (1989) Presented at TIMS/ORSA MeetingVancouver, British Columbia, CanadaGoogle Scholar
• Smith W. E. Various optimizors for single-stage production. Naval Res. Logist. Quart. (1956) 3:59–66Crossref, Google Scholar
• Tsitsiklis J. A short proof of the Gittins index theorem. Ann. Appl. Probab. (1994) 4:194–199Crossref, Google Scholar
• Weber R. On the Gittins index for multi-armed bandits. Ann. Appl. Probab. (1992) 2:1024–1035Crossref, Google Scholar
• Weiss G. Branching bandit processes. Probab. Engrg. Inform. Sci. (1988) 2:269–278Crossref, Google Scholar
• Whittle P. Arm-acquiring bandits. Ann. Probab. (1981) 9:284–292Crossref, Google Scholar
• Whittle P.Optimization over Time (1982) 1(John Wiley, New York, NY) Google Scholar