On an Algorithm for Nash Equilibria Determination in the Informational Extended Bimatrix Games

The informational aspect for the non-cooperative games becomes an important element for the most of the make decision problems. In this article the informational extended games $_{1}\Gamma $ and $_{2}\Gamma $ are defined. For these informational extended bimatrix games we present two modes for construction of the extended matrices and an algorithm for determination of Nash equilibria. For this algorithm we make some modifications and present an algorithm for determination of Nash equilibria in the informational extended bimatrix games in the case, in which the dimensions of the matrices are too big. Using this algorithm we can also determine the number of Nash equilibria in the informational extended game, without using the extended matrices.