On the optimality of a simple strategy for searching graphs

@article{Gal2001OnTO,
  title={On the optimality of a simple strategy for searching graphs},
  author={Shmuel Gal},
  journal={Int. J. Game Theory},
  year={2001},
  volume={29},
  pages={533-542}
}
Consider a search game with an immobile hider in a graph. A Chinese postman tour is a closed trajectory which visits all the points of the graph and has minimal length. We show that encircling the Chinese postman tour in a random direction is an optimal search strategy if and only if the graph is weakly Eulerian (i.e it consists of several Eulerian curves connected in a tree-like structure). 

From This Paper

Topics from this paper.
28 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Search games

  • S Gal
  • Search games
  • 1980
Highly Influential
4 Excerpts

Games, graphs and algorithms The Netherlands

  • Jh Reijnierse
  • Games, graphs and algorithms The Netherlands
  • 1995
1 Excerpt

Private communication

  • Jh Reijnierse, Jam Potters
  • Private communication
  • 1993
3 Excerpts

Search games with immobile hider

  • Jh Reijnierse, Jam Potters
  • Internat. J. Game Theory
  • 1993
3 Excerpts

Di¨erential games

  • R Isaacs
  • Di¨erential games
  • 1965
1 Excerpt

To appear) Search games and rendezvous theory Boston On the optimality of a simple strategy for searching graphs

  • S Alpern, S Gal
  • To appear) Search games and rendezvous theory…

Similar Papers

Loading similar papers…