On the optimality of a simple strategy for searching graphs

Shmuel Gal

doi:10.1007/s001820000056

On the optimality of a simple strategy for searching graphs

Shmuel Gal

Department of Statistics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	533-542
Number of pages	10
Journal	International Journal of Game Theory
Volume	29
Issue number	4
DOIs	https://doi.org/10.1007/s001820000056
State	Published - Dec 2000

Keywords

Chinese postman tour
Search game
Weakly Eulerian graph
Weakly cyclic graph

ASJC Scopus subject areas

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

Access to Document

10.1007/s001820000056

Cite this

@article{1a666af7b12443e8b92b13fd44fb1549,

title = "On the optimality of a simple strategy for searching graphs",

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 = "Chinese postman tour, Search game, Weakly Eulerian graph, Weakly cyclic graph",

author = "Shmuel Gal",

year = "2000",

month = dec,

doi = "10.1007/s001820000056",

language = "English",

volume = "29",

pages = "533--542",

journal = "International Journal of Game Theory",

issn = "0020-7276",

publisher = "Springer Verlag",

number = "4",

}

TY - JOUR

T1 - On the optimality of a simple strategy for searching graphs

AU - Gal, Shmuel

PY - 2000/12

Y1 - 2000/12

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

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

KW - Chinese postman tour

KW - Search game

KW - Weakly Eulerian graph

KW - Weakly cyclic graph

UR - http://www.scopus.com/inward/record.url?scp=0039608445&partnerID=8YFLogxK

U2 - 10.1007/s001820000056

DO - 10.1007/s001820000056

M3 - Article

AN - SCOPUS:0039608445

SN - 0020-7276

VL - 29

SP - 533

EP - 542

JO - International Journal of Game Theory

JF - International Journal of Game Theory

IS - 4

ER -

On the optimality of a simple strategy for searching graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this