Using Path Induction to Evaluate Sequential Allocation Procedures

DOI10.1137/S1064827595291820MaRDI QIDQ4702372zbMATH OpenFDO

Authors Q. F. Stout, Janis P. Hardwick

Publication date 24 November 1999

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S1064827595291820

zbMATH Keywords

adaptive allocationbackward inductionbandit problemsBayesianforward inductiongroup samplingpath countingstagestochastic optimization

Mathematics Subject Classification ID

Sequential statistical design (62L05) Stochastic programming (90C15) Programming involving graphs or networks (90C35)

Recommendations

• A program for sequential allocation of three Bernoulli populations
• An empirical evaluation of several methods to select the best system
• Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
• Selecting a selection procedure

Cited in

(4)

• Optimal screening designs with flexible cost and constraint structures
• A program for sequential allocation of three Bernoulli populations
• A Markov decision process for response-adaptive randomization in clinical trials
• Optimal adaptive designs for acute oral toxicity assessment

This page was built for publication: Using Path Induction to Evaluate Sequential Allocation Procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702372)