Ambush Strategies in Search Games on Graphs

DOI10.1137/0324002zbMath0596.90110OpenAlexW1988809574MaRDI QIDQ3730382

Miroslav D. Asic, Steven Alpern

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1137/0324002

zbMATH Keywords

strategiestwo-person zero-sum gamesearch gameAmbush strategiesblind hiderblind searchernonlotteringsearch game on three arcssearch games on graphs

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (7)

Optimal search and ambush for a hider who can escape the search region ⋮ A Discrete Search-Ambush Game with a Silent Predator ⋮ Search game in a rectangle ⋮ A remark on the Princess and Monster search game ⋮ Finding a moving fugitive. A game theoretic representation of search ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ Static search games played over graphs and general metric spaces

This page was built for publication: Ambush Strategies in Search Games on Graphs