A program for sequential allocation of three Bernoulli populations

Computational Statistics and Data Analysis

Volumn 31, Issue 4, 1999, Pages 397-416

  Hardwick, Janis ^a   Oehmke, Robert ^b   Stout, Quentin F ^b  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Adaptive allocation; Clinical trial; Design of experiments; Dynamic programming; High performance computing; Load balancing; Multi arm bandit; Parallel computing; Recursive equations; Sequential sampling

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SYSTEMS PROGRAMMING; COMPUTER WORKSTATIONS; DYNAMIC PROGRAMMING; PARALLEL PROCESSING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

BERNOULLI POPULATION; SEQUENTIAL ALLOCATION PROBLEMS;

POPULATION STATISTICS;

EID: 0033356625     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9473(99)00039-0     Document Type: Article

References (22)

1. Armitage, P., 1985. The search for optimality in clinical trials. Int. Statist. Rev. 53, 15-24.
2. Atallah, M. (Ed.), 1999. Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton, 1999.
3. Bather, J.A., Coad, D.S., 1992. Sequential procedures for comparing several medical treatments. Sequential Anal. 11, 339-376.
4. Berry, D.A., Eick, S.G., 1995. Adaptive assignment versus balanced randomization in clinical trials -a decision-analysis. Statist. Med. 14, 231-246.
5. Berry, D.A., Fristedt, B., 1985. Bandit Problems: Sequential Allocation of Experiments. Chapman & Hall, London.
6. Betensky, R.A., 1996. An O'Brien-Fleming sequential trial for comparing three treatments. Ann. Statist. 24, 1765-1791.
7. Betensky, R.A., 1997. Sequential analysis of censored survival data from three treatment groups. Biometrics 53, 807-822.
8. Buringer, H., Martin, H., Schriever, K., 1980. Nonparametric Sequential Selection Procedures. Birkhauser, Basal.
9. Coad, D.S., 1995. Sequential allocation rules for multi-armed clinical trials. J. Statist. Comput. Simul. 52, 239-251.
10. Gittins, J.C., 1989. Multi-Armed Bandit Allocation Indices. Wiley, New York.
11. Gropp, W., Lusk, E., Skjellum, A., 1995. Using MPI: Portable Parallel Programming with the Message Passing Interface. MIT Press, Cambridge, MA.
12. Gupta, S.S., Liang, T., 1989. Selecting the best binomial population: parametric empirical Bayes approach. J. Statist. Plann. Inference 23, 21-31.
13. Hardwick, J., Oehmke, R., Stout, Q.F., 1997. A parallel program for 3-arm bandits. Comput. Sc. Statist. 29, 390-395.
14. Hardwick, J., Oehmke, R., Stout, Q.F., 1998. Adaptive allocation in the presence of missing outcomes. Comput. Sci. Statist. 30, 219-223.
15. Hardwick, J., Stout, Q.F., 1993. Exact computational analyses for adaptive designs. In: Flournoy, N., Rosenberger, W.F. (Eds.), Adaptive Designs. Institute Math. Stat. Lec. Notes, Vol. 25, 223-237.
16. Hardwick, J., Stout, Q.F., 1999. Using path induction for evaluating sequential allocation procedures. SIAM J. Sci. Comput. 21, 67-87.
17. Jones, P., 1992. Multiobjective Bayesian Bandits. Bayesian Statistics 4: Proceedings of the fourth Valencia Int'l Meeting, 689-695.
18. Kulkarni, R., Kulkarni, V., 1987. Optimal Bayes procedures for selecting the better of two Bernoulli populations. J. Statist. Plann. Inference 15, 311-330.
19. Oehmke, R., Hardwick, J., Stout, Q.F., 1999. Scalable parallel implementation of high-dimensional dynamic programming. In preparation.
20. Palmer, C., 1993. Selecting the best of k treatments, In: Flournoy, N., Rosenberger, W.F. (Eds.), Adaptive Designs. Institute Math. Stat. Lec. Notes, Vol. 25, 110-123.
21. Siegmund, D., 1993. A sequential clinical trial for comparing three treatments. Ann. Statist. 21, 464-483.
22. Wang, Y.-G., 1991. Sequential allocation in clinical trials. Commun. Statist. Theory Methods 20, 791-805.