Yet more on the linear search problem |
| |
Authors: | Anatole Beck D. J. Newman |
| |
Affiliation: | 1. Hebrew University of Jerusalem, Israel 2. University of G?tingen, Germany 3. University of Warwick, USA 4. University of Wisconsin, USA 5. Yeshiva University, USA
|
| |
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. 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|