MATHEMATICAL MODELS OF ANTISUBMARINE TACTICS

Abstract

Two types of ASW operations are considered: (1) a hunter-killer force (P1) is searching for a submarine (P2), and (2) P1 is attacking P2. Both of these types of operations are formulated as two-person zero-sum games. These game formulations distinguish this work from the literature since they allow P2 as well as P1 to choose tactics. Both sequential and non-sequential search games are developed. Secondary objectives and additional information are included by extending these games to constrained game formulations. Sequential games are also developed. When the players move, they not only determine a payoff but also the probability that the play terminates. The strategies which minimax the expected duration of the game must also maximin the one-step termination probability. A stochastic game due to Shapley is used to study attack operations. Finally, multiple contact problems are investigated.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1966
Accession Number
AD0483267

Entities

People

  • Roger G. Schroeder

Organizations

  • Northwestern University

Tags

Communities of Interest

  • C4I
  • Ground and Sea Platforms
  • Human Systems

DTIC Thesaurus Topics

  • Antisubmarine Warfare
  • Computational Science
  • Dynamic Programming
  • Game Theory
  • Linear Programming
  • Markov Chains
  • Mathematical Models
  • Mathematical Programming
  • Matrix Games
  • Operations Research
  • Optimization
  • Probabilistic Models
  • Probability
  • Probability Distributions
  • Random Variables
  • Simplex Method
  • Zero-Sum Games

Readers

  • Game Theory.
  • Maritime and Naval Warfare Studies
  • Statistical inference.