Zero-sum polymatrix games: a generalization of minmax (Q2806824)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6582389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Zero-sum polymatrix games: a generalization of minmax |
scientific article; zbMATH DE number 6582389 |
Statements
19 May 2016
0 references
polymatrix games
0 references
zero-sum games
0 references
efficient algorithm for Nash equilibria
0 references
convergence of no-regret dynamics
0 references
Zero-sum polymatrix games: a generalization of minmax (English)
0 references
0.8598223924636841
0 references
0.8218230605125427
0 references
0.815094530582428
0 references
0.8135088682174683
0 references
0.8086801171302795
0 references
