276Accesses
2Citations
Abstract
We consider a ‘manhunting’ game in which one player, the Hider, chooses one of several cells to hide and a second player, the Seeker, distributes his resources among the several cells. The cells differ in their characteristics: it may be easier to hide in some cells, or there may be a lower probability of betrayal in others, etc. The Hider’s survival probability depends on the characteristics of the cell chosen, as well as on the amount of resources which the Seeker expends in that cell. The Hider may need to carry out some activity while in his cell. If so, the activity creates a signal which can help the Seeker to locate the Hider. The Seeker must of course try to distinguish between the noise due to the activity and random “white” noise. We obtain a complete analytic solution for the case without signals. Simulation is used to develop good strategies for the case with signals.
This is a preview of subscription content,log in via an institution to check access.
Access this article
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
Price includes VAT (Japan)
Instant access to the full article PDF.
Similar content being viewed by others
References
Brooks RR, Schwier J, Griffin C (2009) Markovian search games in heterogeneous spaces. IEEE Trans Syst Man Cybern B Cybern 39:626–35
Dobbie JM (1975) Search for an avoiding target. SIAM J Appl Math 28:72–86
Fokkink R, Lindelauf R (2013) The application of search games to counter terrorism studies. In: Alpern S, Fokkink R, Gasieniec L, Lindelauf R, Subrahmanian VS (eds) Search theory: a game theoretic perspective. Springer, New York, pp 543–547
Forman JG (1977) Differential search games with a mobile hider. SIAM J Control Optim 15:841–56
Gal S (1979) Search games with a mobile and immobile hider. SIAM J Control Optim 17:99–122
Halpern B (1969) The robot and the rabbit—a pursuit problem. Am Math Mon 76:140–5
McCormick GH, Owen G (2010) Manhunting: a simple search game. Int Game Theory Rev 12:293–308
Nakai T (1986) A sequential evasion—search game with a goal. J Oper Res Soc Jpn 29:113–21
Owen G, McCormick GH (2006) Finding a moving fugitive—a game theoretic representation of search. Comput Oper Res 35:1944–62
Thomas LC, Washburn AR (1991) Dynamic search games. Oper Res 39:415–22
Washburn AR (1980) Search evasion game in a fixed region. Oper Res 28:1290–8
Author information
Authors and Affiliations
Defense Analysis Department, Naval Postgraduate School, Monterey, CA, USA
Gordon McCormick
Department of Mathematics, Naval Postgraduate School, Monterey, CA, USA
Guillermo Owen
- Gordon McCormick
You can also search for this author inPubMed Google Scholar
- Guillermo Owen
You can also search for this author inPubMed Google Scholar
Corresponding author
Correspondence toGuillermo Owen.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
McCormick, G., Owen, G. A composite game of hide and seek.Cent Eur J Oper Res27, 1–14 (2019). https://doi.org/10.1007/s10100-017-0516-5
Published:
Issue Date:
Share this article
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative