Online Concealed Correlation and Bounded Rationality
AbstractCorrelation 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp659.
Length: 46 pages
Date of creation: Feb 2014
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2014-04-11 (All new papers)
- NEP-CTA-2014-04-11 (Contract Theory & Applications)
- NEP-GER-2014-04-11 (German Papers)
- NEP-GTH-2014-04-11 (Game Theory)
- NEP-HPE-2014-04-11 (History & Philosophy of Economics)
- NEP-MIC-2014-04-11 (Microeconomics)
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.:
- Olivier Gossner & Abraham Neyman & PenÃ©lope HernÃ¡ndez, 2005.
"Optimal Use Of Communication Resources,"
Working Papers. Serie AD, Instituto Valenciano de Investigaciones EconÃ³micas, S.A. (Ivie)
2005-06, Instituto Valenciano de Investigaciones EconÃ³micas, S.A. (Ivie).
- Olivier Gossner & Penelope Hernandez & Abraham Neyman, 2004. "Optimal Use of Communication Resources," Discussion Paper Series, The Center for the Study of Rationality, Hebrew University, Jerusalem dp377, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- 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.
- Itzhak Gilboa & David Schmeidler, 1989. "Infinite Histories and Steady Orbits in Repeated Games," Discussion Papers, Northwestern University, Center for Mathematical Studies in Economics and Management Science 846, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
- Gossner, O., 1999.
"Repeated Games played by Cryptographically Sophesticated Players,"
Papers, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor.
99-07, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor..
- GOSSNER, Olivier, 1998. "Repeated games played by cryptographically sophisticated players," CORE Discussion Papers, UniversitÃ© catholique de Louvain, Center for Operations Research and Econometrics (CORE) 1998035, UniversitÃ© catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- 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.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ilan Nehama).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.