The complexity of computing best-response automata in repeated games (Q1106110)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of computing best-response automata in repeated games |
scientific article; zbMATH DE number 4061025
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing best-response automata in repeated games |
scientific article; zbMATH DE number 4061025 |
Statements
The complexity of computing best-response automata in repeated games (English)
0 references
1988
0 references
best-response automaton
0 references
repeated game
0 references
polynomial time complexity
0 references
