Solutions of a Special Reconnaissance Game

Abstract

In this paper, solutions are given for a special case of a general reconnaissance model previously investigated by S. Sherman in Total Reconnaissance with Total Countermeasures: Simplified Model. The same Notation will be used here in so far as possible. Some examples are given in detail illustrating how the theorems established in Solutions of Discrete, Two-Person Games insure that all of the extreme points of the sets of optimal strategies have been found.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 10, 1949
Accession Number
ADA800000

Entities

People

  • R. L. Belzer

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Air Force
  • California
  • Convex Sets
  • Countermeasures
  • Reconnaissance
  • Theorems
  • Two Dimensional
  • United States

Fields of Study

  • Mathematics

Readers

  • Archaeological Resource Survey
  • Game Theory.
  • Theoretical Analysis.