Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game
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 non-in...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2018-05-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v26-n1/v26-n1-(pp39-58).pdf |
| _version_ | 1811298388117815296 |
|---|---|
| author | Boris Hancu Anatolie Gladei |
| author_facet | Boris Hancu Anatolie Gladei |
| author_sort | Boris Hancu |
| collection | DOAJ |
| description | 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 non-informational 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. |
| first_indexed | 2024-04-13T06:18:34Z |
| format | Article |
| id | doaj.art-ecf5fbb04bfe41acb3f561adbe92b0f2 |
| institution | Directory Open Access Journal |
| issn | 1561-4042 |
| language | English |
| last_indexed | 2024-04-13T06:18:34Z |
| publishDate | 2018-05-01 |
| publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
| record_format | Article |
| series | Computer Science Journal of Moldova |
| spelling | doaj.art-ecf5fbb04bfe41acb3f561adbe92b0f22022-12-22T02:58:44ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422018-05-01261(76)3958Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended gameBoris Hancu0Anatolie Gladei1Moldova State University, Chisinau, Mateevici str. 60Moldova State University, Chisinau, Mateevici str. 60We 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 non-informational 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.http://www.math.md/files/csjm/v26-n1/v26-n1-(pp39-58).pdfgamestrategyNash equilibriumBayes-Nash solutionparallel algorithmtime complexitycommunication complexity |
| spellingShingle | Boris Hancu Anatolie Gladei Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game Computer Science Journal of Moldova game strategy Nash equilibrium Bayes-Nash solution parallel algorithm time complexity communication complexity |
| title | Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game |
| title_full | Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game |
| title_fullStr | Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game |
| title_full_unstemmed | Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game |
| title_short | Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game |
| title_sort | parallel algorithm to find bayes nash solution to the bimatrix informational extended game |
| topic | game strategy Nash equilibrium Bayes-Nash solution parallel algorithm time complexity communication complexity |
| url | http://www.math.md/files/csjm/v26-n1/v26-n1-(pp39-58).pdf |
| work_keys_str_mv | AT borishancu parallelalgorithmtofindbayesnashsolutiontothebimatrixinformationalextendedgame AT anatoliegladei parallelalgorithmtofindbayesnashsolutiontothebimatrixinformationalextendedgame |