PARALLEL ALGORITHM TO FIND BAYES-NASH SOLUTION

Gladei, Anatolie; Hancu, Boris

dc.contributor.author	Hancu, Boris
dc.contributor.author	Gladei, Anatolie
dc.date.accessioned	2018-12-19T13:16:34Z
dc.date.available	2018-12-19T13:16:34Z
dc.date.issued	2018
dc.identifier.citation	HANCU, 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.issn	1561-4042
dc.identifier.uri
dc.identifier.uri	http://dspace.usm.md:8080/xmlui/handle/123456789/1909
dc.description.abstract	We 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.language.iso	en	en
dc.publisher	Institutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldovei	en
dc.subject	game	en
dc.subject	Bayes-Nash solution	en
dc.subject	parallel algorithm	en
dc.subject	Nash equilibrium	en
dc.subject	time complexity	en
dc.subject	communication complexity	en
dc.title	PARALLEL ALGORITHM TO FIND BAYES-NASH SOLUTION	en
dc.type	Article	en