Repeated games with bounded entropy

DOI10.1006/GAME.1999.0725MaRDI QIDQ1973449zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Strategic entropy and complexity in repeated games
• On finite strategy sets for finitely repeated zero-sum games.
• Playing games with bounded entropy
• Publication:4783401

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1054720 (Why is no real title available?)
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Finitely many players with bounded recall in infinitely repeated games
• Finitely repeated games with finite automata
• On complexity as bounded rationality (extended abstract)
• Repeated games with finite automata
• Repeated games with stationary bounded recall strategies
• Strategic entropy and complexity in repeated games

Cited in

(22)

• Codification schemes and finite automata
• Strategic entropy and complexity in repeated games
• scientific article; zbMATH DE number 1841907 (Why is no real title available?)
• Bounded computational capacity equilibrium
• On finite strategy sets for finitely repeated zero-sum games.
• Persuasion with limited communication capacity
• Computer science and decision theory
• How to play with a biased coin?
• Finitely many players with bounded recall in infinitely repeated games
• Simulation of a random variable and its application to game theory
• Playing off-line games with bounded rationality
• The operator approach to entropy games
• scientific article; zbMATH DE number 7366790 (Why is no real title available?)
• Correlation through bounded recall strategies
• Playing games with bounded entropy
• Unpredictability of complex (pure) strategies
• Informationally optimal correlation
• The complexity of interacting automata
• The strategic value of recall
• Limits of correlation in repeated games with bounded memory
• Growth of strategy sets, entropy, and nonstationary bounded recall
• When is the lowest equilibrium payoff in a repeated game equal to the minmax payoff?

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1973449)