Advanced Search
MyIDEAS: Login

Some Asymptotic Results in Discounted Repeated Games of One-Sided Incomplete Information

Contents:

Author Info

  • Jonathan P. Thomas

    (University of St. Andrews)

  • Martin Cripps

    (University of Warwick)

Abstract

The paper analyzes the Nash equilibria of two-person discounted repeated games with one-sided incomplete information and known own payoffs. If the informed player is arbitrarily patient relative to the uninformed player, then the characterization for the informed player's payoffs is essentially the same as that in the undiscounted case. This implies that even small amounts of incomplete information can lead to a discontinuous change in the equilibrium payoff set. For the case of equal discount factors, however, and under an assumption that strictly individually rational payoffs exist, a result akin to the Folk Theorem holds when a complete information game is perturbed by a small amount of incomplete information.

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: http://128.118.178.162/eps/game/papers/0004/0004003.pdf
Download Restriction: no

Bibliographic Info

Paper provided by EconWPA in its series Game Theory and Information with number 0004003.

as in new window
Length: 45 pages
Date of creation: 14 Jun 2000
Date of revision:
Handle: RePEc:wpa:wuwpga:0004003

Note: Type of Document - Acrobat PDF; prepared on IBM PC; pages: 45 ; figures: included. pdf file, prepared from sci word
Contact details of provider:
Web page: http://128.118.178.162

Related research

Keywords: reputation; Folk Theorem; repeated games; incomplete information;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Cripps,Martin & Scmidt,Klaus & Thomas,Jonathan, 1993. "Reputation in pertubed repeated games," Discussion Paper Serie A 410, University of Bonn, Germany.
  2. Kalai, Ehud & Lehrer, Ehud, 1993. "Rational Learning Leads to Nash Equilibrium," Econometrica, Econometric Society, vol. 61(5), pages 1019-45, September.
  3. FORGES, Françoise, 1988. "Repeated games of incomplete information: non-zero-sum," CORE Discussion Papers 1988005, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  4. James Bergin, 1986. "A Characterization of Sequential Equilibrium Strategies in Infinitely Repeated Incomplete Information Games," Discussion Papers 686, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  5. Jordan J. S., 1995. "Bayesian Learning in Repeated Games," Games and Economic Behavior, Elsevier, vol. 9(1), pages 8-20, April.
  6. Zamir, Shmuel, 1992. "Repeated games of incomplete information: Zero-sum," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 5, pages 109-154 Elsevier.
  7. Drew Fudenberg & Eric Maskin, 1987. "On the Dispensability of Public Randomization in Discounted Repeated Games," Working papers 467, Massachusetts Institute of Technology (MIT), Department of Economics.
  8. Shalev Jonathan, 1994. "Nonzero-Sum Two-Person Repeated Games with Incomplete Information and Known-Own Payoffs," Games and Economic Behavior, Elsevier, vol. 7(2), pages 246-259, September.
  9. Sorin, Sylvain, 1999. "Merging, Reputation, and Repeated Games with Incomplete Information," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 274-308, October.
Full references (including those not matched with items on IDEAS)

Citations

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

Cited by:
  1. Nicolas Jacquemet & Frédéric Koessler, 2011. "Using or Hiding Private Information? An experimental Study of Zero-Sum Repeated Games with Incomplete Information," Documents de travail du Centre d'Economie de la Sorbonne 11002, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
  2. Stefano, LOVO, 2007. "Belief-free equilibria in games with incomplete information," Les Cahiers de Recherche 884, HEC Paris.
  3. 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.

Lists

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

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:0004003. 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: (EconWPA).

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.