Parallel algorithm to determine the solutions of the bimatrix informational extended games
Închide
Articolul precedent
Articolul urmator
272 0
SM ISO690:2012
CATARANCIUC, Emil, HANCU, Boris. Parallel algorithm to determine the solutions of the bimatrix informational extended games. In: Conference on Applied and Industrial Mathematics: CAIM 2018, 20-22 septembrie 2018, Iași, România. Chișinău, Republica Moldova: Casa Editorial-Poligrafică „Bons Offices”, 2018, Ediţia a 26-a, pp. 70-71. ISBN 978-9975-76-247-2.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Conference on Applied and Industrial Mathematics
Ediţia a 26-a, 2018
Conferința "Conference on Applied and Industrial Mathematics"
Iași, România, Romania, 20-22 septembrie 2018

Parallel algorithm to determine the solutions of the bimatrix informational extended games


Pag. 70-71

Cataranciuc Emil, Hancu Boris
 
Moldova State University
 
 
Disponibil în IBN: 1 iunie 2022


Rezumat

Using the MPI-OpenMP programming model and ScaLAPACK -BLACS packages we have elaborated the parallel algorithm to nd the all equilibrium pro les (I; c) in the game Г Bayes. We can demonstrate the following theorem that estimate the run time performance and communication complexity of the parallel algorithm.