Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-28T21:15:39.430Z Has data issue: false hasContentIssue false
  • English
  • Français

A minimax optimal stop rule in reliability checking

Part of: Stochastic processes

Published online by Cambridge University Press:  14 July 2016

José M. Gouweleeuw
José M. Gouweleeuw*
Affiliation:
Statistics Netherlands, Voorburg
*
∗Postal address: Department of Statistical Methods, Statistics Netherlands, P.O. Box 959, 2270 AZ Voorburg, The Netherlands. Email address: jgww@cbs.nl
Get access Rights & Permissions [Opens in a new window]

Abstract

Consider a machine, which may or may not have a defect, and the probability q that this machine is defective is unknown. In order to determine whether the machine is defective, it is tested. On each test, the defect is found with probability p, if it has not been found yet. Performing n tests costs cn dollars and there is a fine of 1 dollar if there is a defect and it is not found on the tests. When should we stop testing, in order to minimize the cost?

This problem is treated in a minimax setting: we try to find a strategy that works well, even for ‘bad’ q's. It turns out that the minimax optimal stop rule can be unexpectedly complicated. For example, if p = 1/2 and cn = cn = 0.25n, then the optimal rule is to start by performing one test. If a defect is found we stop, otherwise we perform a second test. If a defect is found, then again we stop, else toss a coin and stop if this shows heads. If we still have not stopped, a third and last test is performed.

Keywords

Optimal stopping timeminimax optimal stop rulerandomized stop rule

MSC classification

Primary: 60G40: Stopping times; optimal stopping problems; gambling theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 35 , Issue 3 , September 1998 , pp. 748 - 761
Copyright
Copyright © Applied Probability Trust 1998 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Boshuizen, F. A., and Hill, T. P. (1992). Moment-based minimax stopping functions for sequences of random variables. Stoc. Proc. Appl. 43, 303–316.Google Scholar
Chow, Y. S., Robbins, H., and Siegmund, D. (1971). Great Expectations, the Theory of Optimal Stopping. Houghton, Boston.Google Scholar
Chow, C-W., and Schechner, Z. (1985). On stopping rules in proofreading. J. Appl. Prob. 22, 971–977.Google Scholar
Ferguson, T. S., and Hardwick, J. P. (1989). Stopping rules for proofreading. J. Appl. Prob. 26, 304–313.CrossRefGoogle Scholar
Hill, T. P., and Krengel, U. (1991). Minimax-optimal stop rules and distributions in secretary problems. Ann. Prob. 19, 342–353.Google Scholar