The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609)
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 7101715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The real computational complexity of minmax value and equilibrium refinements in multi-player games |
scientific article; zbMATH DE number 7101715 |
Statements
The real computational complexity of minmax value and equilibrium refinements in multi-player games (English)
0 references
5 September 2019
0 references
minmax value
0 references
Nash equilibrium refinements
0 references
computational complexity
0 references
existential theory of the reals
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9970586895942688
0 references
0.8654703497886658
0 references
0.8508219122886658
0 references
0.8485842943191528
0 references
