Using path induction to evaluate sequential allocation procedures

SIAM Journal of Scientific Computing

Volumn 21, Issue 1, 1999, Pages 67-87

  Hardwick, Janis P ^a   Stout, Quentin F ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRITICAL PATH ANALYSIS; FREQUENCY DOMAIN ANALYSIS; PERT; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SAMPLING;

BAYESIAN BANDIT PROBLEMS; GROUP SAMPLING; PATH INDUCTION; SEQUENTIAL ALLOCATION;

DYNAMIC PROGRAMMING;

EID: 0033294724     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827595291820     Document Type: Article

References (17)

1. R. AGRAWAL, M. V. HEGDE, AND D. TENEKETZIS, Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching costs, IEEE Trans. Automat. Control, 33 (1988), pp. 899-906.
2. J. BATHER, Response adaptive allocation and selection bias, in Adaptive Designs, N. Flournoy and W. F. Rosenberger, eds., IMS Lecture Notes-Monogr. Ser. 25, IMS, Hayward, CA, 1995, pp. 23-35.
3. R. E. BECHHOFER, J. KIEFER, AND M. SOBEL, Sequential Identification and Ranking Procedures, University of Chicago Press, Chicago, IL, 1968.
4. R. BELLMAN, Adaptive Control Processes: A Guided Tour, Princeton University Press, Princeton, NJ, 1961.
5. D. A. BERRY AND S. G. EICK, Adaptive assignment versus balanced randomization in clinical trials - A decision-analysis, Stat. Medicine, 14 (1995), pp. 231-246.
6. R. N. BRADT, S. M. JOHNSON, AND S. KARLIN, On sequential designs for maximizing the sum of n observations, Ann. Math. Stat., 27 (1956), pp. 1060-1074.
7. H. BURINGER, H. MARTIN, AND K. H. SCHRIEVER, Nonparametric Sequential Selection Procedures, Birkhauser, Boston, 1980.
8. J. C. GITTINS, Bandit processes and dynamic allocation indices, J. Roy. Statist. Soc. Ser. B, 41 (1979), pp. 148-177.
9. J. HARDWICK AND Q. F. STOUT, Bandit strategies for ethical sequential allocation, Comput. Sci. Statist., 23 (1991), pp. 421-424.
10. J. HARDWICK AND Q. F. STOUT, Determining optimal few-stage allocation rules, Comput. Sci. Statist., 27 (1995), pp. 342-346.
11. P. W. JONES, Multiobjective Bayesian bandits, in Bayesian Statistics 4, J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith, eds., Oxford University Press, London, 1992, pp. 689-695.
12. M. KOLONKO AND H. BENZING, The sequential design of Bernoulli experiments including switching costs, Oper. Res., 33 (1985), pp. 412-426.
13. C. MEHTA AND N. PATEL, A network algorithm for performing Fisher's exact test in r × c contingency tables, J. Amer. Statist. Assoc., 78 (1983), pp. 427-434.
14. H. ROBBINS, Some aspects of the sequential design of experiments, Bull. Amer. Math. Soc., 58 (1952), pp. 527-535.
15. W. R. THOMPSON, On the likelihood that one unknown probability exceeds another in view of the evidence of two samples, Biometrika, 25 (1933), pp. 275-294.
16. L. J. WEI AND S. DURHAM, The randomized play the winner rule in medical trials, J. Amer. Statist. Assoc., 73 (1978), pp. 840-843.
17. M. ZELEN, Play-the-winner rule and the controlled clinical trial, J. Amer. Statist. Assoc., 64 (1969), pp. 131-146.