Robust Preallocated Preferential Defense.

Abstract

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 paper 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1985
Accession Number
ADA159884

Entities

People

  • J. Bracken
  • J. E. Falk
  • P. S. Brooks

Organizations

  • Institute for Defense Analyses

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Air Force
  • Arms Control
  • Classification
  • Computer Programming
  • Doctrine
  • Engineering
  • Game Theory
  • Governments
  • International Security
  • Linear Programming
  • Operations Research
  • Probability
  • Recreation
  • Security
  • Space Systems
  • Weapons
  • Zero-Sum Games

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Missile Defense Systems.
  • Operations Research
  • Strategic Security Studies