Abstract:
We propose to use the new methodology for solving the com-
plete and perfect information bimatrix game. To solve the ga-
mes of these type we construct the incomplete and imperfect
information game generated by the informational extended stra-
tegies. Then we construct associated Bayesian game with non-
informational extended strategies. For a HPC cluster computing
system with shared and distributed memory, we constuct a paral-
lel algorithm for computing Bayes-Nash solutions to the bimatrix
informational extended games. The complexity and time perfor-
mance analysis of the algorithm are provided.
