Repeated games with bounded entropy

DOI10.1006/game.1999.0725zbMath1112.91304OpenAlexW2130218465MaRDI QIDQ1973449

Abraham Neyman, Daijiro Okada

Publication date: 6 February 2001

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/game.1999.0725

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)

Related Items (18)

The complexity of interacting automata ⋮ Bounded computational capacity equilibrium ⋮ When is the lowest equilibrium payoff in a repeated game equal to the minmax payoff? ⋮ Correlation through bounded recall strategies ⋮ Limits of correlation in repeated games with bounded memory ⋮ Playing games with bounded entropy ⋮ On finite strategy sets for finitely repeated zero-sum games. ⋮ The strategic value of recall ⋮ Playing off-line games with bounded rationality ⋮ When can limited randomness be used in repeated games? ⋮ Informationally optimal correlation ⋮ Computer science and decision theory ⋮ Codification schemes and finite automata ⋮ Growth of strategy sets, entropy, and nonstationary bounded recall ⋮ Simulation of a Random Variable and its Application to Game Theory ⋮ Persuasion with limited communication capacity ⋮ Unpredictability of complex (pure) strategies ⋮ How to play with a biased coin?

Cites Work

• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Repeated games with stationary bounded recall strategies
• Finitely many players with bounded recall in infinitely repeated games
• Repeated games with finite automata
• Strategic entropy and complexity in repeated games
• Finitely Repeated Games with Finite Automata
• On complexity as bounded rationality (extended abstract)
• Unnamed Item
• Unnamed Item

This page was built for publication: Repeated games with bounded entropy