Theory of Search Games and Rendezvous

Book I considers the zero-sum game that results when the target (here called the Hider) does not want to be found. In this case the Searcher and the Hider can be thought of as a team of agents (simply called Player I and Player II) with identical aims, and the coordination problem they jointly face is called the Rendezvous Search Problem.