Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game (Q1650409)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game |
scientific article; zbMATH DE number 6898238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game |
scientific article; zbMATH DE number 6898238 |
Statements
Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game (English)
0 references
3 July 2018
0 references
bimatrix game
0 references
strategy
0 references
Nash equilibrium
0 references
Bayes-Nash solution
0 references
parallel algorithm
0 references
time complexity
0 references
communication complexity
0 references
0.8172706365585327
0 references
0.7969497442245483
0 references
0.7651509046554565
0 references
0.7596325278282166
0 references
0.7594435214996338
0 references
