Optimal search and ambush for a hider who can escape the search region
From MaRDI portal
(Redirected from Publication:322755)
Recommendations
Cites work
- scientific article; zbMATH DE number 3245077 (Why is no real title available?)
- A continuous game of ambush
- A discrete search-ambush game with a silent predator
- A foraging problem: sit-and-wait versus active predation
- A generalization of Ruckle's results for an ambush game
- A graph patrol problem with random attack times
- A remark on the customs and smuggler game
- Ambush Strategies in Search Games on Graphs
- Ambush and active search in multistage predator-prey interactions
- An Ambush Game with an Unknown Number of Infiltrators
- Applications of search in biology: some open problems
- Interactions between searching predators and hidden prey
- On search games that include ambush
- Optimal ambushing search for a moving target
- Optimal trade-off between speed and acuity when searching for a small object
- Patrolling a perimeter
- Search Games with Mobile and Immobile Hider
- Search games
- Search games and other applications of game theory
- Static search games played over graphs and general metric spaces
- The search value of a network
- The theory of search games and rendezvous.
- Two-Person Zero-Sum Games for Network Interdiction
- Weighted search games
Cited in
(6)- 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
- scientific article; zbMATH DE number 1522929 (Why is no real title available?)
- A discrete search-ambush game with a silent predator
- On search games that include ambush
- A normal form game model of search and pursuit
This page was built for publication: Optimal search and ambush for a hider who can escape the search region
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322755)