Detection of a target moving in a network

The area of search theory can be divided broadly on two parts, one-sided search and two-sided [7]. Thus, in this paper, we deal with a two-sided search games played by a searcher and a mobile target with a rather simple type of motion called the conditionally deterministic motion (CDM). Here, the target motion takes place on a network and, more precisely, on a set of possible paths. After a general introduction of two-person zero-sum games, we examine various formulations of a search game for a target moving across a network. Then, this approach is extended to interdiction games and multiple detections.