A GAME THEORETIC ANALYSIS OF THE CONVOY-ASW PROBLEM

Abstract

The problem of allocation of ASW forces assigned to an oceanic convoy in a submarine warfare environment is postulated as a two-person game with the payoff function being based on the 'formula of random search.' The opponents in the game are a convoy system and a submarine system. A submarine is given the option of attacking the convoy system either from afar with surface-launched missiles or near with torpedoes. The convoy system is defended by units capable of destroying submarines exercising either of their options. The optimal allocation of forces for both sides is shown to be a set of pure strategies which are dependent on the parameters of the model.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1967
Accession Number
AD0831654

Entities

People

  • Ingolf N. Kiland Jr.
  • Jerry A. Kotchka

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Ground and Sea Platforms

DTIC Thesaurus Topics

  • Aircrafts
  • Antisubmarine Aircraft
  • Detection
  • Game Theory
  • Government (Foreign)
  • Matrix Games
  • Naval Operations
  • Navy
  • Nuclear Powered Submarines
  • Operations Research
  • Probability
  • Search Theory
  • Ships
  • Submarine Warfare
  • Submarines
  • Vehicles
  • Zero-Sum Games

Readers

  • Game Theory.
  • Maritime and Naval Warfare Studies
  • Missile Defense Systems.