A discrete search-ambush game with a silent predator

DOI10.1007/978-1-4614-6825-7_16zbMATH Open1356.91015OpenAlexW140586216MaRDI QIDQ2961409FDOQ2961409

Authors: Robert Arculus 

Publication date: 20 February 2017

Published in: Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_16

Recommendations

• Optimal search and ambush for a hider who can escape the search region
• Manhunting -- a simple search game
• On search games that include ambush
• More on the search for an infiltrator
• scientific article; zbMATH DE number 18884

Mathematics Subject Classification ID

Applications of game theory (91A80) Population dynamics (general) (92D25) Positional games (pursuit and evasion, etc.) (91A24)

Cites Work

• The theory of search games and rendezvous.
• Search games
• A foraging problem: sit-and-wait versus active predation
• The search value of a network
• Ambush Strategies in Search Games on Graphs
• An Ambush Game with an Unknown Number of Infiltrators
• Title not available (Why is that?)

Cited In (8)

• A foraging problem: sit-and-wait versus active predation
• Optimal search and ambush for a hider who can escape the search region
• An Ambush Game with an Unknown Number of Infiltrators
• Ambush and active search in multistage predator-prey interactions
• Hunter, Cauchy rabbit, and optimal Kakeya sets
• A Preemptive Detection Game
• On search games that include ambush
• A normal form game model of search and pursuit

This page was built for publication: A discrete search-ambush game with a silent predator

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