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.

On a Quickest Detection Problem with Costly Information

D. W. Balmer
Journal of Applied Probability
Vol. 12, No. 1 (Mar., 1975), pp. 87-97
DOI: 10.2307/3212410
Stable URL: http://www.jstor.org/stable/3212410
Page Count: 11
  • Read Online (Free)
  • 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.
On a Quickest Detection Problem with Costly Information
Preview not available

Abstract

Problems of detecting the arrival of a 'disorder' are of central importance in quality control. One such problem is formulated as an optimal stopping problem in which information about the process to be stopped may be bought at any time. A control policy will involve a determination of times at which information should be bought and of the time at which the process should be stopped. It is shown that in all circumstances there is a unique policy satisfying necessary conditions for optimality; the various circumstances and control policies are specified.

Page Thumbnails

  • Thumbnail: Page 
87
    87
  • Thumbnail: Page 
88
    88
  • Thumbnail: Page 
89
    89
  • Thumbnail: Page 
90
    90
  • Thumbnail: Page 
91
    91
  • Thumbnail: Page 
92
    92
  • Thumbnail: Page 
93
    93
  • Thumbnail: Page 
94
    94
  • Thumbnail: Page 
95
    95
  • Thumbnail: Page 
96
    96
  • Thumbnail: Page 
97
    97