Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
790 8 |
Ultima descărcare din IBN: 2020-12-20 01:53 |
Căutarea după subiecte similare conform CZU |
519.8 (172) |
Cercetări operaționale (OR) teorii şi metode matematice (169) |
SM ISO690:2012 HANCU, Boris, GLADEI, Anatol. Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game. In: Computer Science Journal of Moldova, 2018, nr. 1(76), pp. 39-58. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 1(76) / 2018 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 519.8 | ||||||
Pag. 39-58 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
We propose to use the new methodology for solving the complete and perfect information bimatrix game. To solve the games of these type we construct the incomplete and imperfect information game generated by the informational extended strategies. Then we construct associated Bayesian game with noninformational extended strategies. For a HPC cluster computing system with shared and distributed memory, we constuct a parallel algorithm for computing Bayes-Nash solutions to the bimatrix informational extended games. The complexity and time performance analysis of the algorithm are provided. |
||||||
Cuvinte-cheie game, strategy, Nash equilibrium, parallel algorithm, time complexity, Bayes-Nash solution, communication complexity. |
||||||
|