Accession Number:

ADA071374

Title:

Constrained Matrix Games in Fleet Defense Problems -- The Basic Model

Descriptive Note:

Technical note

Corporate Author:

STANFORD RESEARCH INST MENLO PARK CA NAVAL WARFARE RESEARCH CENTER

Personal Author(s):

Report Date:

1976-11-16

Pagination or Media Count:

88.0

Abstract:

We are concerned with Fleet Defense Planning Problems in which the composition of both sides is fixed, each side is uncertain about what the other side has and how it will use what it has, and the planner wants to know how best to use his forces when opposed by an intelligent, responsive enemy. The principal study outputs of value in this class of problems are the optimal decisions equivalently, the optimal game-theoretic strategies. Our approach is to take a Fleet Defense scenario involving the protection of a Carrier Task Force against enemy air attack, formulate the two-sided tactical problems in game-theoretic terms under uncertainty, and solve the problem by CMG methods in order to answer the scenarios basic active-passive questions and aircraft and missile employment questions.

Subject Categories:

  • Numerical Mathematics
  • Antiaircraft Defense Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE