Parallel algorithm to solve two person game with perfect information
Închide
Articolul precedent
Articolul urmator
587 1
Ultima descărcare din IBN:
2024-03-15 02:07
SM ISO690:2012
HÂNCU, Boris. Parallel algorithm to solve two person game with perfect information. In: Conference of Mathematical Society of the Republic of Moldova, 19-23 august 2014, Chișinău. Chișinău: "VALINEX" SRL, 2014, 3, pp. 366-369. ISBN 978-9975-68-244-2.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Conference of Mathematical Society of the Republic of Moldova
3, 2014
Conferința "Conference of Mathematical Society of the Republic of Moldova"
Chișinău, Moldova, 19-23 august 2014

Parallel algorithm to solve two person game with perfect information

Pag. 366-369

Hâncu Boris
 
Молдавский Государственный Университет
 
 
Disponibil în IBN: 13 octombrie 2017


Rezumat

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 pro¯le in informational extended games.

Cuvinte-cheie
informational extended games, complete and perfect information, Bayes-Nash equilibrium