On search games that include ambush

DOI10.1137/110845665MaRDI QIDQ5408804zbMATH OpenOpenAlexFDO

Authors Shmuel Gal, Marco Timmer, Steve Alpern, Robbert Fokkink

Publication date 11 April 2014

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL http://resolver.tudelft.nl/uuid:2b755356-0ace-4aee-a059-8cec5b664901

zbMATH Keywords

ambush strategynoisy search gamePoisson process

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Ambush Strategies in Search Games on Graphs
• A discrete search-ambush game with a silent predator
• Optimal search and ambush for a hider who can escape the search region
• Manhunting -- a simple search game
• scientific article; zbMATH DE number 4125215

Cited in

(10)

• Search games and other applications of game theory
• A discrete search-ambush game with a silent predator
• Hunter, Cauchy rabbit, and optimal Kakeya sets
• Optimal trade-off between speed and acuity when searching for a small object
• Optimal search and ambush for a hider who can escape the search region
• Ambush Strategies in Search Games on Graphs
• Ambush and active search in multistage predator-prey interactions
• Control sequencing in a game of identity pursuit-evasion
• A Combinatorial Model of Two-Sided Search
• Safe navigation in adversarial environments

This page was built for publication: On search games that include ambush

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408804)