Yet more on the linear search problem
Yet more on the linear search problem
复制标题
关于线性搜索问题的更多内容
DOI：
--
复制
发表时间：
1970
期刊：
影响因子：
--
通讯作者：
D. Newman
中科院分区：
文献类型：
--
作者：
A. Beck;D. Newman
线性搜索问题之前已由一位作者讨论过。在本文中，搜索者不知道实线上搜索点的概率分布。由于不存在先验的分布选择，因此我们将这种情况视为游戏并获得极小极大类型的解决方案。根据希望最小化（或最大化）的因素，应用不同的最小最大。制定了某些标准，帮助读者判断所获得的结果是否可以被视为解决与此类似的实际问题的“好建议”。
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.