On the optimality of a simple strategy for searching graphs

Shmuel Gal ()
Additional contact information
Shmuel Gal: The University of Haifa, Haifa 31905, Israel

International Journal of Game Theory, 2001, vol. 29, issue 4, 533-542

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

Keywords: Search; game; ·; weakly; Eulerian; graph; ·; weakly; cyclic; graph; ·; Chinese; postman; tour (search for similar items in EconPapers)
Date: 2001-05-04
Note: Received: December 1999/Revised version: September 2000
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.de/link/service/journals/00182/papers/1029004/10290533.pdf (application/pdf)
Access to the full text of the articles in this series is restricted

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:29:y:2001:i:4:p:533-542

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().