Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-13T05:31:45.137Z Has data issue: false hasContentIssue false

On stopping rules in proofreading

Published online by Cambridge University Press:  14 July 2016

Chung-Wen Chow*
Affiliation:
Columbia University
Zvi Schechner*
Affiliation:
Columbia University
*
Postal address: Department of Industrial Engineering and Operations Research, Columbia University, Seeley W. Mudd Building, New York, NY 10027, USA.
Postal address: Department of Industrial Engineering and Operations Research, Columbia University, Seeley W. Mudd Building, New York, NY 10027, USA.

Abstract

Stopping rules in the context of proofreading are studied. Previous results by Yang et al. [6] are corrected and a computational procedure to obtain an optimal rule is presented.

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1985 

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.)

Footnotes

This research has been supported by the National Science Foundation under Grant DMS-84-05413 to Columbia University.

References

[1] Chow, Y. S., Robbins, H. and Siegmund, D. (1972) Great Expectations: The Theory of Optimal Stopping. Houghton Mifflin, Boston.Google Scholar
[2] Derman, C., Lieberman, G. and Ross, S. M. (1983) Inspections with unknown detection probabilities. Tech. Report, Department of Operations Research, Stanford University, Stanford, Ca. Google Scholar
[3] Feller, W. (1968) An Introduction to Probability Theory and Its Applications , Vol. 1, 3rd edn. Wiley, New York.Google Scholar
[4] Pólya, G. (1976) Probabilities in proofreadings. Amer. Math. Month. 83, 42.Google Scholar
[5] Tierney, L. (1983) The hazards of optimal proofreading. Adv. Appl. Prob. 15, 892893.Google Scholar
[6] Yang, M. C. K., Wackerly, D. and Rosalsky, A. (1982) Optimal stopping rules in proofreading. J. Appl. Prob. 19, 723729.Google Scholar