Reputation in the Long-Run with Imperfect Monitoring
We study an infinitely repeated game where two players with equal discount factors play a simultaneous-move stage game. Player one monitors the stagegame actions of player two imperfectly, while player two monitors the pure stagegame actions of player one perfectly. Player one’s type is private information and he may be a “commitment type,” drawn from a countable set of commitment types, who is locked into playing a particular strategy. Under a full-support assumption on the monitoring structure, we prove a reputation result for games with locally nonconflicting interests or games with strictly conflicting interests: if there is positive probability that player one is a particular type whose commitment payoff is equal to player one’s highest payoff, consistent with the players’ individual rationality, then a patient player one secures this type’s commitment payoff in any Bayes-Nash equilibrium of the repeated game. In contrast, if the type’s commitment payoff is strictly less than player one’s highest payoff consistent with the players’ individual rationality, then the worst perfect Bayesian equilibrium payoff for a patient player one is equal to his minimax payoff.
|Date of creation:||01 Aug 2009|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1506. 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: (Fran Walker)
If references are entirely missing, you can add them using this form.