Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Computing Optimal Sequential Allocation Rules in Clinical Trials

Michael N. Katehakis and Cyrus Derman
Lecture Notes-Monograph Series
Vol. 8, Adaptive Statistical Procedures and Related Topics (1986), pp. 29-39
Stable URL: http://www.jstor.org/stable/4355518
Page Count: 11
  • Read Online (Free)
  • Download ($19.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Computing Optimal Sequential Allocation Rules in Clinical Trials
Preview not available

Abstract

The problem of assigning one of several treatments in clinical trials is formulated as a discounted bandit problem that was studied by Gittins and Jones. The problem involves comparison of certain state dependent indices. A recent characterization of the index is used to calculate more efficiently the values of these indices.

Page Thumbnails

  • Thumbnail: Page 
29
    29
  • Thumbnail: Page 
30
    30
  • Thumbnail: Page 
31
    31
  • Thumbnail: Page 
32
    32
  • Thumbnail: Page 
33
    33
  • Thumbnail: Page 
34
    34
  • Thumbnail: Page 
35
    35
  • Thumbnail: Page 
36
    36
  • Thumbnail: Page 
37
    37
  • Thumbnail: Page 
38
    38
  • Thumbnail: Page 
39
    39