This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Online Concealed Correlation by Boundedly Rational Players

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Gilad Bavly ()
Abraham Neyman ()

Additional information is available for the following registered author(s):

Abstract

In a repeated game with perfect monitoring, correlation among a group of players may evolve in the common course of play (online correlation). Such a correlation may be concealed from a boundedly rational player. The feasibility of such “online concealed correlation” is quantified by the individually rational payoff of the boundedly rational player. We show that “strong” players, i.e., players whose strategic complexity is less stringently bounded, can orchestrate online correlation of the actions of “weak” players, in a manner that is concealed from an opponent of “intermediate” strength. The result is illustrated in two models, each captures another 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 Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://ratio.huji.ac.il/dp/Neyman336.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp336.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 36 pages
Date of creation: Sep 2003
Date of revision:
Handle: RePEc:huj:dispap:dp336

Contact details of provider:
Postal: Feldman Building - Givat Ram - 91904 Jerusalem
Phone: +972-2-6584135
Fax: +972-2-6513681
Email:
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Ron Peretz).

Related research
Keywords:

Other versions of this item:

This paper has been announced in the following NEP Reports: 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.:
  1. 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. [Downloadable!] (restricted)
    Other versions:
  2. 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. [Downloadable!]
    Other versions:
  3. Olivier Gossner & Penelope Hernandez & Abraham Neyman, 2003. "Online Matching Pennies," Discussion Paper Series dp316, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem. [Downloadable!]
  4. Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
  5. Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February. [Downloadable!] (restricted)
  6. GOSSNER, Olivier & TOMALA, Tristan, 2003. "Entropy and codification in repeated games with imperfect monitoring," CORE Discussion Papers 2003033, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE). [Downloadable!]
  7. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229. [Downloadable!] (restricted)
  8. Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October. [Downloadable!] (restricted)
  9. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June. [Downloadable!] (restricted)
Full references

Cited by:
(explanations, 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.)

  1. George J. Mailath & Wojciech Olszewski, 2008. "Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring," PIER Working Paper Archive 08-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania. [Downloadable!]
    Other versions:
  2. George J. Mailath & : Wojciech Olszewski, 2008. "Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring, Second Version," PIER Working Paper Archive 08-027, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 28 Jul 2008. [Downloadable!]
Statistics
Access and download statistics

Did you know? There are NEP reports in over 80 fields that deliver new research to your email.

This page was last updated on 2009-11-22.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.