Premium
Robust preallocated preferential defense
Author(s) -
Bracken Jerome,
Brooks Peter S.,
Falk James E.
Publication year - 1987
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(198702)34:1<1::aid-nav3220340103>3.0.co;2-2
Subject(s) - computer science , computer security , range (aeronautics) , set (abstract data type) , function (biology) , robustness (evolution) , robust optimization , mathematical optimization , mathematics , engineering , biochemistry , chemistry , evolutionary biology , gene , biology , programming language , aerospace engineering
The problem is to protect a set of T identical targets that may come under attack by A identical weapons. The targets are to be defended by D identical interceptors, which must be preallocated to defend selected targets. The attacker is aware of the number of interceptors, but is ignorant of their allocation. The size of the attack is chosen by the attacker from within a specified range. The robust strategies developed in this article do not require the defender to assume an attack size. Rather, the defender chooses a strategy which is good over a wide range of attack sizes, though not necessarily best for any particular attack size. The attacker, knowing that the defender is adopting a robust strategy, chooses the optimal attack strategy for the number of weapons he chooses to expend. The expected number of survivors is a function of the robust defense strategy and optimal attack strategy against this robust defense.