On an Algorithm for Nash Equilibria Determination in the Informational Extended Bimatrix Games
Abstract
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 Γ and 2 Γ 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.
Keywords:
Informational extended bimatrix games, Nash equilibria, solution in pure strategies, extended matrices, algorithm of Nash equilibria determination
Downloads
References
Hâncu, B., Novac, L. (2005). Informational a spects in the Game Theory. Annals of the Tiberiu Popoviciu Seminar of Functional Equations, Approximation and Convexity., Vol. 3, Cluj-Napoca, pp. 25–34.
Novac, L. (2004). Informational extended games. Second conference of the Matemathical Society of the Rep. of Moldova, (dedicated to the 40th Annyv. of the found. of the Instit. of Math. and Comp. Science of ASM), Communications, Chishinau, pp. 232–234.
Novac, L. (2009). Informational extensions in the game theory. PhD. thesis, (rom), USM, Chisinau, pp. 41–69.
Downloads
Published
How to Cite
Issue
Section
License
Articles of "Contributions to Game Theory and Management" are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.