A PROBLEM IN OPTIMAL SEARCH AND STOP
Abstract
An object is hidden in one of m (m < infinity) boxes and there is given prior probabilities p sub i superscript 0 that the object is in the ith box. A search of box i costs c sub i and finds the object with probability alpha sub i if the object is in the box. Suppose that a reward is earned if the object is found in the ith box. A strategy is any rule for determining when to search and if so which box. The major result is that an optimal strategy either searches a box with maximal value of (alpha sub i)p sub i/c sub i or else it never searches those boxes. Also, if rewards are equal, then an optimal strategy either searches a box with maximal (alpha sub i)p sub i/c sub i or else it stops.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 05, 1968
- Accession Number
- AD0675204
Entities
People
- Sheldon M. Ross
Organizations
- Stanford University