A continuous game of ambush

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(198710)34:5<645::AID-NAV3220340505>3.0.CO;2-0" /><645::AID-NAV3220340505>3.0.CO;2-0 10.1002/1520-6750(198710)34:5<645::AID-NAV3220340505>3.0.CO;2-0zbMath0659.90096OpenAlexW2074817650MaRDI QIDQ3809608

F. A. Bostock, Victor J. Baston

Publication date: 1987

Full work available at URL: https://doi.org/10.1002/1520-6750(198710)34:5<645::aid-nav3220340505>3.0.co;2-0

zbMATH Keywords

kerneltwo-person zero-sum gamecontinuous gamesubintervalstactical problems of ambush

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (7)

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 ⋮ New results on a Ruckle problem in discrete games of ambush ⋮ Patrolling a Border ⋮ The Value of the Two Cable Ambush Game ⋮ A generalization of Ruckle's results for an ambush game ⋮ On a square haystack game

Cites Work

• Unnamed Item

This page was built for publication: A continuous game of ambush