Robustness of Preallocated Preferential Defense with Assumed Attack Size and Perfect Attacking and Defending Weapons

摘要

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 m1 attackers, and the attacker knows the assumption of the defender and utilized m2 attackers, he may be able to achieve significantly more damage than the defender assumed that there would be m2 attackers. The paper treats the robustness of preallocated preferential defense to assumptions about the size of the attack and presents results of an alternative approach.