On the optimality of a simple strategy for searching graphs

Research output: Contribution to journalArticlepeer-review

Abstract

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).

Original languageEnglish
Pages (from-to)533-542
Number of pages10
JournalInternational Journal of Game Theory
Volume29
Issue number4
DOIs
StatePublished - Dec 2000

Keywords

  • Chinese postman tour
  • Search game
  • Weakly cyclic graph
  • Weakly Eulerian graph

ASJC Scopus subject areas

  • Statistics and Probability
  • Mathematics (miscellaneous)
  • Social Sciences (miscellaneous)
  • Economics and Econometrics
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'On the optimality of a simple strategy for searching graphs'. Together they form a unique fingerprint.

Cite this