论文信息 - Finding a hider by an unknown deadline

Finding a hider by an unknown deadline

An object is hidden among several locations. Each search at the object's location independently finds the object with some location-dependent probability. The goal is to find the object by a deadline, but the deadline is unknown. Assuming the worst-case scenario, where Nature knows the deadline and uses this knowledge to hide the object to hinder the search, this paper shows that there is a randomized search strategy that simultaneously maximizes the probability of finding the object by any deadline.

Dashi I. Singham | Kyle Y. Lin

[1] J. Kadane. Discrete search and the Neyman-Pearson Lemma , 1968 .

[2] Ingo Wegener. The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities , 1980, Math. Oper. Res..

[3] Sheldon M. Ross,et al. A Problem in Optimal Search and Stop , 1969, Oper. Res..

[4] Milton C. Chew. Optimal Stopping in a Discrete Search Problem , 1973, Oper. Res..

[5] E. J. Subelman. A hide–search game , 1981, Journal of Applied Probability.

[6] Milton C. Chew. A Sequential Search Procedure , 1967 .

[7] L. Stone. Theory of Optimal Search , 1975 .

[8] J. C. Gittins,et al. The search for an intelligent evader: Strategies for searcher and evader in the two‐region problem , 1978 .

[9] William L. Black,et al. Discrete Sequential Search , 1965, Inf. Control..

[10] J. C. Gittins,et al. The search for an intelligent evader concealed in one of an arbitrary number of regions , 1979 .

[11] David W. Matula. A Periodic Optimal Search , 1964 .

[12] Shmuel Gal,et al. The theory of search games and rendezvous , 2002, International series in operations research and management science.

[13] Roberto Szechtman,et al. Optimal discrete search with imperfect specificity , 2008, Math. Methods Oper. Res..

[14] Joseph B. Kadane,et al. Optimal Whereabouts Search , 1971, Oper. Res..