Network search games, with arbitrary searcher starting point

Arnon Dagan, Shmuel Gal

Research output: Contribution to journalArticlepeer-review


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. Weshowthatforsome networks, including trees, the optimal searcher, and hider strategies have a simple structure.

Original languageEnglish
Pages (from-to)156-161
Number of pages6
Issue number3
StatePublished - Oct 2008


  • Absolute center
  • Chinese postman
  • Network search
  • Search games
  • Star search
  • Weakly Eulerian

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications

Cite this