The complexity of computing a best response automaton in repeated games with mixed strategies (Q1193774): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0899-8256(90)90010-r / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989538212 / rank | |||
Normal rank | |||
Latest revision as of 09:08, 30 July 2024
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
