On search games that include ambush

Steve Alpern; Robbert Fokkink; Shmuel Gal; Marco Timmer

doi:10.1137/110845665

On search games that include ambush

Steve Alpern, Robbert Fokkink, Shmuel Gal, Marco Timmer

Department of Statistics

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

Abstract

We present a stochastic game that models ambush/search in a finite region Q which has area but no other structure. The searcher can search a unit area of Q in unit time or adopt an "ambush" mode for a certain period. The searcher "captures" the hider when the searched region contains the hider's location or if the hider moves while the searcher is in ambush mode. The payoff in this zero sum game is the capture time. Our game is motivated by the (still unsolved) princess and monster game on a star graph with a large number of leaves.

Original language	English
Pages (from-to)	4544-4556
Number of pages	13
Journal	SIAM Journal on Control and Optimization
Volume	51
Issue number	6
DOIs	https://doi.org/10.1137/110845665
State	Published - 2013

Keywords

Ambush strategy
Noisy search game
Poisson process

ASJC Scopus subject areas

Control and Optimization
Applied Mathematics

Access to Document

10.1137/110845665

Cite this

@article{2b0f5e30198346d689ef82c6b480171b,

title = "On search games that include ambush",

abstract = "We present a stochastic game that models ambush/search in a finite region Q which has area but no other structure. The searcher can search a unit area of Q in unit time or adopt an {"}ambush{"} mode for a certain period. The searcher {"}captures{"} the hider when the searched region contains the hider's location or if the hider moves while the searcher is in ambush mode. The payoff in this zero sum game is the capture time. Our game is motivated by the (still unsolved) princess and monster game on a star graph with a large number of leaves.",

keywords = "Ambush strategy, Noisy search game, Poisson process",

author = "Steve Alpern and Robbert Fokkink and Shmuel Gal and Marco Timmer",

year = "2013",

doi = "10.1137/110845665",

language = "English",

volume = "51",

pages = "4544--4556",

journal = "SIAM Journal on Control and Optimization",

issn = "0363-0129",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "6",

}

TY - JOUR

T1 - On search games that include ambush

AU - Alpern, Steve

AU - Fokkink, Robbert

AU - Gal, Shmuel

AU - Timmer, Marco

PY - 2013

Y1 - 2013

N2 - We present a stochastic game that models ambush/search in a finite region Q which has area but no other structure. The searcher can search a unit area of Q in unit time or adopt an "ambush" mode for a certain period. The searcher "captures" the hider when the searched region contains the hider's location or if the hider moves while the searcher is in ambush mode. The payoff in this zero sum game is the capture time. Our game is motivated by the (still unsolved) princess and monster game on a star graph with a large number of leaves.

AB - We present a stochastic game that models ambush/search in a finite region Q which has area but no other structure. The searcher can search a unit area of Q in unit time or adopt an "ambush" mode for a certain period. The searcher "captures" the hider when the searched region contains the hider's location or if the hider moves while the searcher is in ambush mode. The payoff in this zero sum game is the capture time. Our game is motivated by the (still unsolved) princess and monster game on a star graph with a large number of leaves.

KW - Ambush strategy

KW - Noisy search game

KW - Poisson process

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

U2 - 10.1137/110845665

DO - 10.1137/110845665

M3 - Article

AN - SCOPUS:84886383105

SN - 0363-0129

VL - 51

SP - 4544

EP - 4556

JO - SIAM Journal on Control and Optimization

JF - SIAM Journal on Control and Optimization

IS - 6

ER -

On search games that include ambush

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this