On search games that include ambush

Steve Alpern, Robbert Fokkink, Shmuel Gal, Marco Timmer

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)4544-4556
Number of pages13
JournalSIAM Journal on Control and Optimization
Issue number6
StatePublished - 2013


  • Ambush strategy
  • Noisy search game
  • Poisson process

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'On search games that include ambush'. Together they form a unique fingerprint.

Cite this