The search game on a network with immobile hider

In this paper we discuss a search game on a network, Q, with two players, a searcher and a hider. The hider chooses a point on Q at which to hide, while the searcher starts at a given point on Q and moves with continuous trajectory subject to a maximal speed. This is a zero-sum game with payoff given by the time elapsed until the searcher reaches the point occupied by the hider. The solution to this game is known for certain types of network. Here by formulating the problem as an infinite-dimensional linear program, we derive an algorithm for its solution. We discuss the performance of the algorithm on three examples.