Network search games, with arbitrary searcher starting point

Arnon Dagan; Shmuel Gal

doi:10.1002/net.20241

Network search games, with arbitrary searcher starting point

Arnon Dagan, Shmuel Gal

Department of Statistics

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	156-161
Number of pages	6
Journal	Networks
Volume	52
Issue number	3
DOIs	https://doi.org/10.1002/net.20241
State	Published - Oct 2008

Keywords

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

ASJC Scopus subject areas

Information Systems
Computer Networks and Communications

Access to Document

10.1002/net.20241

Cite this

@article{ccd3bbcaaf5545028ccd15f43aa94e21,

title = "Network search games, with arbitrary searcher starting point",

abstract = "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.",

keywords = "Absolute center, Chinese postman, Network search, Search games, Star search, Weakly Eulerian",

author = "Arnon Dagan and Shmuel Gal",

year = "2008",

month = oct,

doi = "10.1002/net.20241",

language = "English",

volume = "52",

pages = "156--161",

journal = "Networks",

issn = "0028-3045",

publisher = "Wiley-Liss Inc.",

number = "3",

}

TY - JOUR

T1 - Network search games, with arbitrary searcher starting point

AU - Dagan, Arnon

AU - Gal, Shmuel

PY - 2008/10

Y1 - 2008/10

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

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

KW - Absolute center

KW - Chinese postman

KW - Network search

KW - Search games

KW - Star search

KW - Weakly Eulerian

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

U2 - 10.1002/net.20241

DO - 10.1002/net.20241

M3 - Article

AN - SCOPUS:45849096250

SN - 0028-3045

VL - 52

SP - 156

EP - 161

JO - Networks

JF - Networks

IS - 3

ER -

Network search games, with arbitrary searcher starting point

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this