The complexity of computing a best response automaton in repeated games with mixed strategies (Q1193774)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing a best response automaton in repeated games with mixed strategies |
scientific article |
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
