PARALLEL ALGORITHM TO FIND THE BAYES-NASH SOLUTION IN THE INFORMATIONAL EXTENDED GAME

Hancu, Boris

dc.contributor.author	Hancu, Boris
dc.date.accessioned	2018-02-26T13:40:20Z
dc.date.available	2018-02-26T13:40:20Z
dc.date.issued	2017
dc.identifier.citation	HANCU, B. Parallel algorithm to find the Bayes-Nash solution in the informational extended game. In: In: The Fourth Conference of Mathematical Society of the Republic of Moldova dedicated to the centenary of V. Andrunachievici (1917-1997): Proceeding CMSM4, June28-July2, 2017. Ch.: CEP USM, 2017, pp. 397-400. ISBN 978-9975-71-915-5.	en
dc.identifier.isbn	978-9975-71-915-5
dc.identifier.uri	http://dspace.usm.md:8080/xmlui/handle/123456789/1664
dc.description.abstract	The Bayes-Nash solutions for informational extended games are discussed. Also the parallel algorithm for mixed system with shared and distributed memory to determine the Bayes-Nash solutions in the bimatrix informational extended games are presented.	en
dc.language.iso	en	en
dc.subject	games	en
dc.subject	strategies	en
dc.subject	Bayes-Nash solution	en
dc.subject	parallel algorithm	en
dc.title	PARALLEL ALGORITHM TO FIND THE BAYES-NASH SOLUTION IN THE INFORMATIONAL EXTENDED GAME	en
dc.type	Article	en