The Folk Theorem for Games with Private, Almost-Perfect Monitoring
We prove the folk theorem for discounted repeated games under private, almost-perfect monitoring. Our result covers all finite, n-player games that satisfy the usual full-dimensionality condition. Mixed strategies are allowed in determining the individually rational payoffs. We assume no cheap-talk communication between players and no public randomization device.
(This abstract was borrowed from another version of this item.)
When requesting a correction, please mention this item's handle: RePEc:cla:najeco:172782000000000006. 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: (David K. Levine)
If references are entirely missing, you can add them using this form.