Search game

A search game is a zero-sum game between at least one searcher and one or more immobile or mobile targets which takes place in a set called the search space. The searcher(s) must detect or capture the target(s) under resource constraints. The searcher can choose any continuous trajectory subject to a maximal velocity constraint. As mathematical models, search games can be applied to areas such as hide-and-seek games that children play or representations of some tactical military situations, such as anti-submarine warfare or air defense, in which a searching vehicle sweeps a region to intercept an adversary historically . Today, these models extend to cybersecurity, where a defender traverses a "state space" of systems and networks in search of adversarial intrusions. There are also used in biology to model predator-prey interactions ,,, where a predator can have finite resources (number of daylight hours, motivation, ...)