Abstract
Shmuel Gal and Jerome Casas have recently introduced a game theoretic model that combines search and pursuit by a predator for a prey animal. The prey (hider) can hide in a finite number of locations. The predator (searcher) can inspect any k of these locations. If the prey is not in any of these, the prey wins. If the prey is found at an inspected location, a pursuit begins which is successful for the predator with a known capture probability which depends on the location. We modify the problem so that each location takes a certain time to inspect and the predator has total inspection time k. We also consider a repeated game model where the capture probabilities only become known to the players over time, as each successful escape from a location lowers its perceived value capture probability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers, Dordrecht (2006)
Alpern, S., Gal, S., Casas, J.: Prey should hide more randomly when a predator attacks more persistently. Journal of the Royal Society Interface 12, 20150861 (2015)
Alpern, S., Gal, S., Lee, V., Casas, J.: A stochastic game model of searching predators and hiding prey. Journal of the Royal Society Interface, 16(153), 20190087 (2019)
Avis, D., Rosenberg, G., Savani, R., Stengel, B. von: Enumeration of Nash Equilibria for Two-Player Games. Economic Theory 42, 9-37 (2010). Online solver available at http://banach.lse.ac.uk.
Chung, T., Hollinger, G., Isler, V.: Search and pursuit-evasion in mobile robotics. Autonomous Robots, 31(4):299–316 (2011)
Gal, S., Casas, J.: Succession of hide–seek and pursuit–evasion at heterogeneous locations. Journal of the Royal Society Interface 11, 20140062 (2014).
Hellerstein, L., Lidbetter, T., Pirutinsky, D.: Solving Zero-sum Games using Best Response Oracles with Applications to Search Games, Operations Research, 67(3):731–743 (2019)
Isaacs, R.: Differential Games. Wiley, New York (1965)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack problems. Berlin: Springer (2004)
Lin, K. Y., Singham, D.: Finding a hider by an unknown deadline. Operations Research Letters 44, 25–32 (2016)
Mech, L. D., Smith, D. W., MacNulty, D. R.: Wolves on the hunt: the behavior of wolves hunting wild prey. University of Chicago Press (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Alpern, S., Lee, V. (2020). A Normal Form Game Model of Search and Pursuit. In: Ramsey, D.M., Renault, J. (eds) Advances in Dynamic Games. Annals of the International Society of Dynamic Games, vol 17. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-56534-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-56534-3_3
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-030-56533-6
Online ISBN: 978-3-030-56534-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)