Abstract
In this paper we suggest a new class of search games, namely, screening and hiding versus search games. This new class of search games is motivated by the book Search and Screening by Koopman who is the founder of the modern search theory. In our game a hider is not just trying to find the best places to hide resources from a searcher, but also it applies efforts to screen their allocations making it more difficult for the searcher to find them. This hiding and screening strategy of the hider versus search strategy of the searcher makes the plot more real-world relative comparing to widely investigated in literature just hiding versus search games. For the suggested game we found the equilibrium strategies of both players as well as we proved uniqueness of the equilibrium.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alpern S, Gal S (2003) The theory of search games and rendezvous. Kluwer Academic Publishers, New York
Anderson EJ, Aramendia MA (1990) The search game on a network with immobile hider. Networks 20:817–844
Baston V, Garnaev A (2000) A search game with a protector. Nav Res Logist 47:85–96
Croucher JS (1975) Application of the fundamental theorem of game to an example concerning antiballistic missle defence. Nav Res Logist Q 22:197–203
Danskin JM (1967) The theory of max–min. Springer, Berlin
Gal S (1979) Search games with mobile and immobile hider. SIAM J Control Optim 17:99–122
Garnaev AY (1991) A search game in a rectangle. J Optim Theory Appl 69:531–542
Garnaev A (2007) Find a hidden treasure. Nav Res Logist 54:109–114
Garnaev A, Fokkink R (2013) A searcher versus hider game with incomplete information about search resources. Asia Pac J Oper Res 30:N2
Hohzaki R (2006) Search allocation game. Eur J Oper Res 172:101–119
Iida K, Hohzaki R, Sato K (1994) Hide-and-search game with the risk criterion. J Oper Res Soc Jpn 37:287–296
Kikuta K, Ruckle WH (1994) Initial point search on weighted trees. Nav Res Logist 41:821–831
Koopman BO (1946) Search and screening. Operations Research Evaluation Group Report 56. Alexandria, Virginia: Center for Naval Analyses
Koopman BO (1980) Search and screening: general principles with historical applications. Pergamon Press, New York
Lalley SP, Robbins H (1988) Stochastic search in a convex region. Probab Theory Relat Fields 77:99–116
Sakaguchi M (1987) A two-sided resource allocation game in search for a stationary object. Math Jpn 32:979–991
Zoroa M, Zoroa P (1993) Some games of search on a lattice. Nav Res Logist 40:525–541
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Garnaev, A., Kikuta, K. Screening and hiding versus search. Math Meth Oper Res 80, 255–265 (2014). https://doi.org/10.1007/s00186-014-0479-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-014-0479-4