Online Concealed Correlation and Bounded Rationality
Correlation of players' actions may evolve in the common course of the play of a repeated game with perfect monitoring (``obline correlation''). In this paper we study the concealment of such correlation from a boundedly rational player. We show that ``strong'' players, i.e., players whose strategic complexity is less stringently bounded, can orchestrate the obline correlation of the actions of ``weak'' players, where this correlation is concealed from an opponent of ``intermediate'' strength. The feasibility of such ``\ol concealed correlation'' is reflected in the individually rational payoff of the opponent and in the equilibrium payoffs of the repeated game. This result enables the derivation of a folk theorem that characterizes the set of equilibrium payoffs in a class of repeated games with boundedly rational players and a mechanism designer who sends public signals. The result is illustrated in two models, each of which captures a different aspect of bounded rationality. In the first, players use bounded recall strategies. In the second, players use strategies that are implementable by finite automata.
|Date of creation:||Feb 2014|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- O. Gossner, 1999.
"Repeated games played by cryptographically sophisticated players,"
THEMA Working Papers
99-07, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
- GOSSNER, Olivier, 1998. "Repeated games played by cryptographically sophisticated players," CORE Discussion Papers 1998035, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Gossner, O., 1999. "Repeated Games played by Cryptographically Sophesticated Players," Papers 99-07, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor..
- Ariel Rubinstein, 1997.
"Finite automata play the repeated prisioners dilemma,"
Levine's Working Paper Archive
1639, David K. Levine.
- Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
- Itzhak Gilboa & David Schmeidler, 1989.
"Infinite Histories and Steady Orbits in Repeated Games,"
846, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Gilboa Itzhak & Schmeidler David, 1994. "Infinite Histories and Steady Orbits in Repeated Games," Games and Economic Behavior, Elsevier, vol. 6(3), pages 370-399, May.
- Olivier Gossner & Penelope Hernandez & Abraham Neyman, 2004.
"Optimal Use of Communication Resources,"
Discussion Paper Series
dp377, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
- Gilad Bavly & Abraham Neyman, 2003. "Online Concealed Correlation by Boundedly Rational Players," Discussion Paper Series dp336, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp659. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ilan Nehama)
If references are entirely missing, you can add them using this form.