RO EN
Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game
Authors: Boris Hancu, Anatolie Gladei
Keywords: game, strategy, Nash equilibrium, Bayes-Nash solution, parallel algorithm, time complexity, communication complexity.
– 0.17 Mb
Keywords: game, strategy, Nash equilibrium, Bayes-Nash solution, parallel algorithm, time complexity, communication complexity.
Abstract
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.Institution: Moldova State University
Address: Chisinau, Mateevici str. 60
Phone: 079030211
E-mail:
Address: Chisinau, Mateevici str. 60
Phone: 079030211
E-mail:
Fulltext
– 0.17 Mb
Contents
- On Nontrivial Covers and Partitions of Graphs by Convex Sets
- Bounds for the Independence Number in k-Step Hamiltonian Graphs
- Vertex weighted Laplacian Energy of union of graphs
- Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game
- Implementation of the Composition-nominative Approach to Program Formalization in Mizar
- Finite automata over magmas: models and some applications in Cryptography
- Annotation on PhD Thesis
- About International Conference MITI2018
