Stopping rules for proofreading

1989 ◽  
Vol 26 (02) ◽  
pp. 304-313 ◽  
Author(s):  
T. S. Ferguson ◽  
J. P. Hardwick
Keyword(s):  
Sample Size ◽  
Optimal Stopping ◽  
Random Number ◽  
Poisson Model ◽  
Stopping Rule ◽  
Stopping Rules ◽  
Binomial Model ◽  
Fixed Sample Size ◽  
Fixed Sample ◽  
Optimal Stopping Rule

A manuscript with an unknown random numberMof misprints is subjected to a series of proofreadings in an effort to detect and correct the misprints. On thenthproofreading, each remaining misprint is detected independently with probabilitypn– 1. Each proofreading costs an amountCP> 0, and if one stops afternproofreadings, each misprint overlooked costs an amountcn> 0. Two models are treated based on the distribution ofM.In the Poisson model, the optimal stopping rule is seen to be a fixed sample size rule. In the binomial model, the myopic rule is optimal in many important cases. A generalization is made to problems in which individual misprints may have distinct probabilities of detection and distinct overlook costs.

Stopping rules for proofreading

1989 ◽  
Vol 26 (2) ◽  
pp. 304-313 ◽  
Author(s):  
T. S. Ferguson ◽  
J. P. Hardwick
Keyword(s):  
Sample Size ◽  
Optimal Stopping ◽  
Random Number ◽  
Poisson Model ◽  
Stopping Rule ◽  
Stopping Rules ◽  
Binomial Model ◽  
Fixed Sample Size ◽  
Fixed Sample ◽  
Optimal Stopping Rule

A manuscript with an unknown random number M of misprints is subjected to a series of proofreadings in an effort to detect and correct the misprints. On the nthproofreading, each remaining misprint is detected independently with probability pn– 1. Each proofreading costs an amount CP > 0, and if one stops after n proofreadings, each misprint overlooked costs an amount cn > 0. Two models are treated based on the distribution of M. In the Poisson model, the optimal stopping rule is seen to be a fixed sample size rule. In the binomial model, the myopic rule is optimal in many important cases. A generalization is made to problems in which individual misprints may have distinct probabilities of detection and distinct overlook costs.

A Multiple Stopping Problem

1994 ◽  
Vol 8 (2) ◽  
pp. 169-177 ◽  
Author(s):  
J. Preater
Keyword(s):  
Optimal Stopping ◽  
Stopping Rule ◽  
Reward Function ◽  
Optimal Stopping Rule ◽  
Multiple Stopping ◽  
Constant Observation ◽  
Independent And Identically Distributed

In the context of team recruitment, we discuss an optimal multiple stopping problem for an infinite independent and identically distributed sequence, with general reward function and constant observation cost. We establish the existence and nature of an optimal stopping rule. For the particular case where team quality is governed by the fitness of the weakest member, we show that the recruiter should be more discriminating with either a better, or a larger, group of appointees in hand.

scholarly journals OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE

2019 ◽  
Vol 33 (3) ◽  
pp. 327-347
Author(s):  
Yi-Shen Lin ◽  
Shoou-Ren Hsiau ◽  
Yi-Ching Yao
Keyword(s):  
Optimal Stopping ◽  
Stopping Rule ◽  
Secretary Problem ◽  
Optimal Selection ◽  
Maximum Probability ◽  
Optimal Stopping Rule ◽  
The Subject ◽  
Selection Of

In the subject of optimal stopping, the classical secretary problem is concerned with optimally selecting the best of n candidates when their relative ranks are observed sequentially. This problem has been extended to optimally selecting the kth best candidate for k ≥ 2. While the optimal stopping rule for k=1,2 (and all n ≥ 2) is known to be of threshold type (involving one threshold), we solve the case k=3 (and all n ≥ 3) by deriving an explicit optimal stopping rule that involves two thresholds. We also prove several inequalities for p(k, n), the maximum probability of selecting the k-th best of n candidates. It is shown that (i) p(1, n) = p(n, n) > p(k, n) for 1<k<n, (ii) p(k, n) ≥ p(k, n + 1), (iii) p(k, n) ≥ p(k + 1, n + 1) and (iv) p(k, ∞): = lim n→∞p(k, n) is decreasing in k.

On the best-choice problem when the number of observations is random

1983 ◽  
Vol 20 (1) ◽  
pp. 165-171 ◽  
Author(s):  
Joseph D. Petruccelli
Keyword(s):  
Optimal Stopping ◽  
Random Variable ◽  
Stopping Rules ◽  
Necessary And Sufficient Condition ◽  
Choice Problem ◽  
Best Choice Problem ◽  
Optimal Stopping Rule ◽  
Optimal Stopping Rules ◽  
Bounded Random Variable ◽  
Necessary And Sufficient

We consider the problem of maximizing the probability of choosing the largest from a sequence of N observations when N is a bounded random variable. The present paper gives a necessary and sufficient condition, based on the distribution of N, for the optimal stopping rule to have a particularly simple form: what Rasmussen and Robbins (1975) call an s(r) rule. A second result indicates that optimal stopping rules for this problem can, with one restriction, take virtually any form.

Large-sample theory of sequential estimation

1952 ◽  
Vol 48 (4) ◽  
pp. 600-607 ◽  
Author(s):  
F. J. Anscombe
Keyword(s):  
Sample Size ◽  
Unknown Parameter ◽  
Correction Term ◽  
Basic Result ◽  
Sequential Estimation ◽  
Uniform Continuity ◽  
Stopping Rule ◽  
Sample Treatment ◽  
Large Sample ◽  
Fixed Sample

In a previous large-sample treatment of sequential estimation (1), it was shown that in certain circumstances, when there was only one unknown parameter in the distribution of the observations, an estimation formula valid for fixed sample sizes remained valid when the sample size was determined by a sequential stopping rule. The proof was heuristic, in that it depended on an application of the central limit theorem of which the justification was not obvious. Another proof has recently been given by Cox (2) (in the course of deriving a correction term to my result). Dr Cox pointed out to me that this work suggested that fixed-sample-size formulae might be valid generally for sequential sampling, provided the sample size was large. In establishing a proposition to that effect, I have now been able to by-pass some of the complexity of my previous approach by concentrating attention on a condition of ‘uniform continuity in probability’ to be satisfied by the statistic used. Theorem 1 is the basic result, which is applied in Theorem 2 to determine a sequential stopping rule giving required accuracy of estimation of an unknown parameter. Theorems 3–6 indicate some situations in which the uniform continuity condition postulated in Theorems 1 and 2 is satisfied. A few examples are discussed.

Sign in / Sign up

Export Citation Format

Share Document