An Ambush Game with an Unknown Number of Infiltrators

DOI10.1287/opre.1040.0122zbMath1165.91331OpenAlexW2169041443MaRDI QIDQ5321737

Vic Baston, Kensaku Kikuta

Publication date: 14 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1040.0122

Mathematics Subject Classification ID

Noncooperative games (91A10) Decision theory for games (91A35)

Related Items (8)

Optimizing periodic patrols against short attacks on the line and other networks ⋮ Optimal search and ambush for a hider who can escape the search region ⋮ Patrolling a perimeter ⋮ Patrolling a Border ⋮ The Value of the Two Cable Ambush Game ⋮ A Discrete Search-Ambush Game with a Silent Predator ⋮ Continuous patrolling and hiding games ⋮ Adversarial Patrolling in a Uniform

This page was built for publication: An Ambush Game with an Unknown Number of Infiltrators