Search Games
Gal Shmuel · Wiley Encyclopedia of Operations Research and Management Science · 2011
Abstract This article surveys the area of search games with immobile and mobile hider. The search space is either a graph, a bounded domain or an unbounded set. The search process is presented as a two‐player zero‐sum game between the searcher and the hider. The searcher moves along a continuous trajectory and the cost function is the time needed to find the hider. An overview is presented with emphasis on general results concerning minimax search trajectories and optimal search strategies.