Self-Fulfilling Mechanisms in Repeated Games with Incomplete Information
AbstractWe consider the class of two-person non-zero-sum infinitely repeated games with incomplete information where Nash equilibria have been characterized, namely games with lack of information on one side and games with private values. We show that in these models, every Nash equilibrium payoff can be achieved by means of a selffulfilling mechanism, which receives a message from every player at the beginning of the game and then transmits a public signal. This signal can be interpreted as a characteristic of the players' strategies. The self-fulfilling property means that given the signal, there are equilibrium strategies whose characteristic coincides with the signal.
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 Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) in its series CORE Discussion Papers with number 1994058.
Date of creation: 01 Oct 1994
Date of revision:
Contact details of provider:
Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)
Fax: +32 10474304
Web page: http://www.uclouvain.be/core
More information through EDIRC
communication equilibrium; incomplete information; Nash equilibrium; repeated game;
Find related papers by JEL classification:
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Alain GILLIS).
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.