PARALLEL ALGORITHM TO SOLVE TWO PERSON GAME WITH PERFECT INFORMATION

Hâncu, Boris

dc.contributor.author	Hâncu, Boris
dc.date.accessioned	2017-09-28T12:03:20Z
dc.date.available	2017-09-28T12:03:20Z
dc.date.issued	2014
dc.identifier.citation	HÂNCU, B. Parallel algorithm to solve two person game with perfect information. In: The Third Conference of Mathematical Society of the Republic of Moldova: dedicated to the 50th anniversary of the foundation of the Institute of Mathematics and Computer Science, 19-23 aug. 2014, Chisinau, Moldova: Proceedings IMCS-50.Ch., 2014, pp.366-369. ISBN 978-9975-68-244-2	en
dc.identifier.isbn	978-9975-68-244-2
dc.identifier.uri	http://dspace.usm.md:8080/xmlui/handle/123456789/1319
dc.description.abstract	In this article for solving the informational extended games we apply the Selten-Harsanyi principle. We elaborate the parallel algorithm to determine the Bayes-Nash equilibrium profile in informational extended games.	en
dc.language.iso	en	en
dc.publisher	Valines SRL	en
dc.subject	informational extended games	en
dc.subject	complete and perfect information	en
dc.subject	Bayes-Nash equilibrium	en
dc.title	PARALLEL ALGORITHM TO SOLVE TWO PERSON GAME WITH PERFECT INFORMATION	en
dc.type	Article	en