The complexity of computing a best response automaton in repeated games with mixed strategies (Q1193774)
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 65216
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing a best response automaton in repeated games with mixed strategies |
scientific article; zbMATH DE number 65216 |
Statements
The complexity of computing a best response automaton in repeated games with mixed strategies (English)
0 references
27 September 1992
0 references
best response automaton
0 references
two-person repeated game
0 references
incomplete information
0 references
0.9424560070037842
0 references
0.8277391195297241
0 references
0.8206154704093933
0 references
0.8198221921920776
0 references
0.8192611336708069
0 references
