The Numerical Solution of Discrete Dynamic Combat Type Games.
GRUMMAN AEROSPACE CORP BETHPAGE N Y RESEARCH DEPT
Pagination or Media Count:
The paper discusses one approach to the solution of two-player discrete dynamic games. Each player has prescribed dynamics and a capture set. The game is formulated as a zero sum game with a simultaneous move structure, thus allowing for mixed strategies. The computer algorithm utilizes a backing up process, reducing the solution of the multistage dynamic game to the solution of many two-player matrix games. Results obtained for specific examples are discussed. The optimal strategy a probability distribution in the case of mixed strategies and the optimal value expected value for mixed strategies are calculated for the complete game state for each discrete time step. A second computer program allows the game to be played with the aid of a computer driven graphic display. Author
- Operations Research
- Military Operations, Strategy and Tactics