A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (Q6090449)
From MaRDI portal
scientific article; zbMATH DE number 7767464
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff |
scientific article; zbMATH DE number 7767464 |
Statements
A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (English)
0 references
17 November 2023
0 references
repeated games
0 references
limit-of-means payoff
0 references
computability
0 references
best response strategies
0 references
subgame-perfect equilibria
0 references
0 references
