Abstract
The linear search problem has been discussed previously by one of the present authors. In this paper, the probability distribution of the point sought in the real line is not known to the searcher. Since there is noa priori choice of distribution which recommends itself above all others, we treat the situation as a game and obtain minimax type solutions. Different minimaxima apply depending on the factors which one wishes to minimize (resp. maximize). Certain criteria are developed which help the reader judge whether the results obtained can be considered “good advice” in the solution of real problems analogous to this one.
Similar content being viewed by others
References
Anatole Beck,On the linear search problem, Israel J. Math.2 (1964), 221–228.
Anatole Beck,More on the linear search problem, Israel J. Math.3 (1965), 61–70.
Richard Bellman,Research Problem No. 63–9, SIAM Rev.5 (1963), 274.
Wallace Franck,On an optimal search problem, SIAM Rev.7 (1965), 503–512.
Author information
Authors and Affiliations
Additional information
The research of this paper has been supported in part by the following agencies: National Science Foundation, Wisconsin Alumni Research Foundation, German Academic Exchange Service (DAAD), and Air Force Office of Scientific Research.
Rights and permissions
About this article
Cite this article
Beck, A., Newman, D.J. Yet more on the linear search problem. Israel J. Math. 8, 419–429 (1970). https://doi.org/10.1007/BF02798690
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02798690