|
Abstract:
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)
| Description: |
Research memo. |
| Pages: |
22 |
| Report Date: |
NOV 1971 |
| Report Number: |
0598337 |
Report Unavailable |
| This title is unavailable from Storming Media. We do not know when it might be available, if at all. We list the report on our site for bibliographic completeness, to help our users know what other work has been performed in this field. Please note that as with all titles on this site, we do not have contact information for any of the authors. Nor can we give any suggestions on how one might obtain this report. |
|
|
|
|
|
Keywords relating to this report:
Email This Abstract
