Premium
Robustness of preallocated preferential defense with assumed attack size and perfect attacking and defending weapons
Author(s) -
Bracken Jerome,
Falk James E.,
Tai A. J. Allen
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<23::aid-nav3220340104>3.0.co;2-f
Subject(s) - robustness (evolution) , computer security , computer science , mathematical economics , mathematics , biochemistry , chemistry , gene
The problem is to protect a set of t targets by n perfect interceptors against an attack by m perfect weapons. If the defender solves for an optimal preallocated preferential defense and associated game value assuming m 1 attackers, and the attacker knows the assumption of the defender and utilizes m 2 attackers, he may be able to achieve significantly more damage than had the defender assumed that there would be m 2 attackers. The article treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach.