Strategic entropy and complexity in repeated games
From MaRDI portal
Publication:1818294
DOI10.1006/game.1998.0674zbMath1002.91004OpenAlexW2099693684MaRDI QIDQ1818294
Publication date: 4 January 2000
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/game.1998.0674
asymptotic behaviorrepeated gamesmeasure of uncertaintymaximin valuesof repeated two-person zero-sum gamesrepeated games with finite automata and bounded recallstrategic entropy
Related Items (15)
The complexity of interacting automata ⋮ Bounded computational capacity equilibrium ⋮ Bounded memory folk theorem ⋮ When is the lowest equilibrium payoff in a repeated game equal to the minmax payoff? ⋮ On finite strategy sets for finitely repeated zero-sum games. ⋮ Repeated games with bounded entropy ⋮ Playing off-line games with bounded rationality ⋮ When can limited randomness be used in repeated games? ⋮ Informationally optimal correlation ⋮ Computer science and decision theory ⋮ Repeated games with one-memory ⋮ Codification schemes and finite automata ⋮ Controlling conditional expectations by zero-determinant strategies ⋮ Persuasion with limited communication capacity ⋮ How to play with a biased coin?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Repeated games with stationary bounded recall strategies
- A note on reactive equilibria in the discounted prisoner's dilemma and associated games
- Finitely many players with bounded recall in infinitely repeated games
- Repeated games with finite automata
- Small talk and cooperation: A note on bounded rationality
- Ergodic theory, entropy
- Finitely Repeated Games with Finite Automata
- On complexity as bounded rationality (extended abstract)
This page was built for publication: Strategic entropy and complexity in repeated games
