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

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 scenario's basic active-passive questions and aircraft and missile employment questions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 16, 1976
Accession Number
ADA071374

Entities

People

  • William H. Frye

Organizations

  • SRI International

Tags

Communities of Interest

  • Air Platforms
  • Human Systems
  • Space
  • Weapons Technologies

DTIC Thesaurus Topics

  • Aircrafts
  • Algorithms
  • Altitude
  • Artificial Satellites
  • Computer Programming
  • Computer Programs
  • Computers
  • Cruise Missiles
  • Detection
  • Game Theory
  • Linear Programming
  • Low Altitude
  • Matrix Games
  • Probability
  • Probability Distributions
  • Random Variables
  • Reconnaissance Aircraft

Readers

  • Aerospace logistics and air mobility.
  • Game Theory.
  • Operations Research