Optimal search and ambush for a hider who can escape the search region
From MaRDI portal
Publication:322755
DOI10.1016/j.ejor.2015.12.017zbMath1348.90345OpenAlexW2204238933MaRDI QIDQ322755
Martin Simanjuntak, Robbert J. Fokkink, Steven Alpern
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.12.017
Search theory (90B40) 2-person games (91A05) Pursuit and evasion games (49N75) Positional games (pursuit and evasion, etc.) (91A24)
Related Items
Shapley, Owen and Aumann-Dreze values in a patrolling game with coalition structure ⋮ Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
Cites Work
- Unnamed Item
- Ambush and active search in multistage predator-prey interactions
- A foraging problem: sit-and-wait versus active predation
- Search games
- The theory of search games and rendezvous.
- Search games and other applications of game theory
- A generalization of Ruckle's results for an ambush game
- Patrolling a perimeter
- Static search games played over graphs and general metric spaces
- Weighted search games
- A Graph Patrol Problem with Random Attack Times
- Interactions Between Searching Predators and Hidden Prey
- A Discrete Search-Ambush Game with a Silent Predator
- Applications of Search in Biology: Some Open Problems
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
- The search value of a network
- Ambush Strategies in Search Games on Graphs
- A continuous game of ambush
- Search Games with Mobile and Immobile Hider
- A remark on the customs and smuggler game
- Two-Person Zero-Sum Games for Network Interdiction
- An Ambush Game with an Unknown Number of Infiltrators
- On Search Games That Include Ambush
- Optimal ambushing search for a moving target
