This paper deals with a search model for allocating effort when there are many target objects
of differing sizes present in a search area. All target objects are initially present in the search …

A target moves between two regions in a Markovian fashion, the parameters of which are
known to the searcher. Discrete amounts of search effort (“looks”) may be allocated to one …

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 …

We consider optimal search for a moving target in discrete space. A limited amount of search
effort is available at each of a fixed number of time intervals and we assume an exponential …

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 …

This paper considers discrete search problems in which a decision-maker has to find objects
lost or hidden in a given set of locations so as to minimize the expected losses incurred …

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 …

INTRODUCTION Koopman [l, 2, 3] has treated the problem of optimum allocation of a given
amount of search effort to the discovery of an object known to be somewhere in a given …

This paper formulates a two-cell model of search for a moving target as a continuous-time
Markov process with known constant transition rates and detection rates, and finds the …

There are n boxes. A target is initially in box i with a given probability p ı, where p ı≧ 0,∑ p
ı= 1. Then at discrete time t= 1, 2,…, it moves from box to box. If at time t the target is in box i …