Advanced Search
MyIDEAS: Login to save this paper or follow this series

3-player repeated games with lack of information on one side


Author Info

  • Renault, Jérôme


We study the existence of uniform equilibria for three-player repeated games with lack of information on one side and perfect observation. If there are only two states of nature, a completely revealing or a joint plan equilibrium always exists. This is not the case for larger spaces of states.

Download Info

If 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.
File URL:
Download Restriction: no

Bibliographic Info

Paper provided by Paris Dauphine University in its series Economics Papers from University Paris Dauphine with number 123456789/6538.

as in new window
Date of creation: 2001
Date of revision:
Publication status: Published in International Journal of Game Theory, 2001, Vol. 30, no. 2. pp. 221-245.Length: 24 pages
Handle: RePEc:dau:papers:123456789/6538

Contact details of provider:
Web page:
More information through EDIRC

Related research

Keywords: repeated games; incomplete information; lack of information on one side; 3 players; uniform equilibrium; existence of equilibria;

Other versions of this item:

Find related papers by JEL classification:


No references listed on IDEAS
You can help add them by filling out this form.


Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Renault, Jerome & Scarlatti, Sergio & Scarsini, Marco, 2005. "A folk theorem for minority games," Games and Economic Behavior, Elsevier, Elsevier, vol. 53(2), pages 208-230, November.
  2. Renault, Jerome & Tomala, Tristan, 2004. "Communication equilibrium payoffs in repeated games with imperfect monitoring," Games and Economic Behavior, Elsevier, Elsevier, vol. 49(2), pages 313-344, November.
  3. Jérôme Renault & Tristan Tomala, 2011. "General Properties of Long-Run Supergames," Dynamic Games and Applications, Springer, Springer, vol. 1(2), pages 319-350, June.
  4. Renault, Jerome & Tomala, Tristan, 2004. "Learning the state of nature in repeated games with incomplete information and signals," Games and Economic Behavior, Elsevier, Elsevier, vol. 47(1), pages 124-156, April.
  5. Koessler, Frédéric & Forges, Françoise, 2008. "Multistage communication with and without verifiable types," Economics Papers from University Paris Dauphine, Paris Dauphine University 123456789/1121, Paris Dauphine University.
  6. Lovo, Stefano & Tomala, Tristan & Hörner, Johannes, 2009. "Belief-free equilibria in games with incomplete information: characterization and existence," Les Cahiers de Recherche 921, HEC Paris.


This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:dau:papers:123456789/6538. 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: (Alexandre Faure).

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.