| Article ID: | iaor1992643 |
| Country: | United Kingdom |
| Volume: | 30 |
| Start Page Number: | 142 |
| End Page Number: | 147 |
| Publication Date: | Aug 1990 |
| Journal: | USSR Computational Mathematics and Mathematical Physics |
| Authors: | Yevseyeva S.A. |
The conflict situations in question are described by repeated two-person bimatrix games. The problem is to determine the maximum guaranteed payoff to the first player. A numerical algorithm computing the solution is constructed and implemented as a program.