An optimal design for screening trials

Biometrics

Volumn 54, Issue 1, 1998, Pages 243-250

  Wang, You Gan ^a   Leung, Denis Heng Yan ^b  

^a CSIRO   (Australia)

^b MEMORIAL SLOAN KETTERING CANCER CENTER   (United States)

Author keywords

Dynamic programming; Markov decision process; Optimality; Sequential clinical trials

Indexed keywords

DIAGNOSIS; DYNAMIC PROGRAMMING; ERRORS; LAGRANGE MULTIPLIERS; LEARNING ALGORITHMS; OPTIMAL SYSTEMS;

EARLY ACCEPTANCE; ERROR RATE; GROUP SIZE; MARKOV DECISION PROCESSES; OPTIMAL DESIGN; OPTIMAL GROUPS; OPTIMALITY; SEQUENTIAL CLINICAL TRIALS; SEQUENTIAL DESIGN; THERAPEUTIC AGENTS;

MARKOV PROCESSES;

ARTICLE; DECISION MAKING; DRUG DESIGN; DRUG SCREENING; PROBABILITY; SAMPLING; SYSTEM ANALYSIS;

EID: 0345404433     PISSN: 0006341X     EISSN: None     Source Type: Journal    
DOI: 10.2307/2534011     Document Type: Article

References (6)

1. Bellman, R. (1957). Dynamic Programming. Princeton, New Jersey: Princeton University Press.
2. Bergman, S. W. and Gittins, J. C. (1985). Statistical Methods for Planning Pharmaceutical Research. New York: Marcel Dekker.
3. Berry, D. A. and Pristedt, B. (1985). Bandit Problems: Sequential Allocation of Experiments. London: Chapman and Hall.
4. Gittins, J. C. (1989). Multi-Armed Bandit Allocation Indices. Chichester: Wiley.
5. Ross, S. M. (1970). Applied Probability Models with Optimization Applications. San Francisco: Holden-Day.
6. Yao, T.-J., Begg, C. B., and Livingston, P. O. (1996). Optimal sample size for a series of pilot trials of new agents. Biometrics 52, 992-1001.