Premium
An infiltration game on k arcs
Author(s) -
Auger John M.
Publication year - 1991
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199108)38:4<511::aid-nav3220380406>3.0.co;2-u
Subject(s) - guard (computer science) , limit (mathematics) , evasion (ethics) , zero sum game , mathematical economics , computer science , mathematical optimization , mathematics , game theory , mathematical analysis , medicine , immune system , immunology , programming language
An infiltrator, starting at a safe base, tries to pass, undetected by a guard and within a time limit, along one of k nonintersecting arcs to a safe destination. Optimal strategies and the value are obtained for this discrete zero‐sum search‐evasion game.