Optimal Whereabouts Search
暂无分享,去创建一个
An optimal whereabouts search maximizes the probability of correctly stating, at the end of a search costing no more than some budget C, which box contains the object. This can be accomplished either by finding the object in the search or by guessing, at the end of an unsuccessful search, which box contains the object. Generalizing work of Tognetti, this paper shows that an optimal whereabouts search never searches the box to be guessed, and gives an algorithm for finding an optimal whereabouts-search strategy. Finally, whereabouts search is compared to a similar problem proposed by Bellman.
[1] R. Bellman. Dynamic programming. , 1957, Science.
[2] Donald F. Mela. Letter to the Editor---Information Theory and Search Theory as Special Cases of Decision Theory , 1961 .
[3] Keith P. Tognetti,et al. Letter to the Editor - An Optimal Strategy for a Whereabouts Search , 1968, Oper. Res..
[4] J. Kadane. Discrete search and the Neyman-Pearson Lemma , 1968 .