A discrete search model for one of many objects hidden in two boxes is studied. The number
of objects is assumed to be a random variable with a known prior distribution. When box i is …

Suppòse one object is hidden in the k‐th of n boxes with probability p (k). We know the
probability q (t, k) of detecting the object if it is hidden in box k and we expend effort t …

By an easy observation we show that the basic result of Blackwell [2], according to which the
most inviting strategy is optimal in a discrete search for one object, is also true when the …

Suppose one object is hidden in the k th of n boxes with probability p (k). The boxes are to
be searched sequentially. Associated with the j th search of box k is a cost c (j, k) and a …

Suppose one object is hidden in the k‐th of n boxes with probability p (k). The boxes are to
be searched sequentially. Associated with the j‐th search of box k is a cost c (j, k) and a …

In a search among m locations for an object possibly hidden in one, we are given prior
probabilities of location pi, searching costs ci, and overlook probabilities α i. It is known also …

Suppose N objects are hidden in m boxes where m is known and N is unknown; for
example, suppose that we are hunting for defects (objects) in a system having several …

Suppose an object is hidden in one of N boxes. The initial prior probability that it is hidden in
box i is known to the searcher, who once a day must choose a box to be searched. The …

Suppose N objects are hidden multinomially in m boxes, where m is known and N is
random. The boxes are to be searched sequentially. Asssociated with a search of box k is a …

An object is hidden in box i with probability P i, for i= 1, 2,…, I. A search of a box detects the
object, given that it is in the box, with probability d. The detection probability d is fixed but …