PARALLEL ALGORITHM TO FIND BAYES-NASH SOLUTION

Simple item page
dc.contributor.authorHancu, Boris
dc.contributor.authorGladei, Anatolie
dc.date.accessioned2018-12-19T13:16:34Z
dc.date.available2018-12-19T13:16:34Z
dc.date.issued2018
dc.description.abstractWe 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.en
dc.identifier.citationHANCU, B., GLADEI, A. Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game. In: Сomputer Science Journal of Moldova. 2018. Nr. 1(76), pp.39 -58. ISSN 1561-4042.en
dc.identifier.issn1561-4042
dc.identifier.uri
dc.identifier.urihttps://msuir.usm.md/handle/123456789/1909
dc.language.isoenen
dc.publisherInstitutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldoveien
dc.subjectgameen
dc.subjectBayes-Nash solutionen
dc.subjectparallel algorithmen
dc.subjectNash equilibriumen
dc.subjecttime complexityen
dc.subjectcommunication complexityen
dc.titlePARALLEL ALGORITHM TO FIND BAYES-NASH SOLUTIONen
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
39-58.pdf
Size:
170.52 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

2. Articole