Network search games, with arbitrary searcher starting point
Arnon Dagan, Gal Shmuel · Networks · 2008
Abstract We analyze a zero‐sum game between a blind unit‐speed searcher and a stationary hider on a given network Q, where the payoff is the time for the searcher to reach the hider. In contrast to the standard game studied in the literature, we do not assume that the searcher has to start from a fixed point (known to the hider) but can choose his starting point. We show that for some networks, including trees, the optimal searcher, and hider strategies have a simple structure. © 2008 Wiley Periodicals, Inc. NETWORKS, 2008