Repeated Games with Observation Costs
This paper analyzes repeated games in which it is possible for players to observe the other players' past actions without noise but it is costly. One's observation decision itself is not observable to the other players, and this private nature of monitoring activity makes it difficult to give the players proper incentives to monitor each other. We provide a sufficient condition for a feasible payoff vector to be approximated by a sequential equilibrium when the observation costs are sufficiently small. We then show that this result generates an approximate Folk Theorem for a wide class of repeated games with observation costs. The Folk Theorem holds for a variant of prisoners' dilemma, partnership games, and any games in which the players have an ability to "burn" small amounts of thier own payoffs.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Jan 2003|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.kier.kyoto-u.ac.jp/eng/index.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:kyo:wpaper:565. 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: (Ryo Okui)
If references are entirely missing, you can add them using this form.