Finding a moving fugitive. A game theoretic representation of search

We develop and analyze a “manhunting” game involving a mobile hider, who wishes to maximize his time to capture, and a mobile searcher, who wishes to minimize this same time. The game takes place within a variegated environment that offers better and worse locations to evade capture. The hider is able to move from one hide site to another at will. In choosing a hide site, he must consider the risk of discovery, the risk that he will be betrayed, and the risk that he will be captured while moving from one site to another. The searcher can select any cell to search within the fugitiveʹs feasible hiding set. We examine the strategic behavior of both players and provide examples.