The Discrete Evasion Game

Abstract

Theoretical and computational aspects of the three-move discrete evasion game are presented. An Evader strategy is given that yields an upper bound of .2890 for the game-value, and a Marksman strategy is given that yields a lower bound of .2842. A particular form for the Marksman strategy is presented which depends on r bits of information, and it is proved that this type of strategy is near-optimal. The results are also applied to the two-move game, which was solved earlier by other workers.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1973
Accession Number
AD0769228

Entities

People

  • Joseph Bram

Organizations

  • Center for Naval Analyses

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Aeronautical Laboratories
  • Algorithms
  • Classification
  • Computational Science
  • Computations
  • Equations
  • Game Theory
  • Linear Programming
  • Mathematical Analysis
  • Numbers
  • Operations Research
  • Physics
  • Physics Laboratories
  • Probability
  • Security
  • Theorems
  • War Colleges

Fields of Study

  • Mathematics

Readers

  • Game Theory.
  • Operations Research