Belief-free Equilibria in Games with Incomplete Information: Characterization and Existence
We characterize belief-free equilibria in infinitely repeated games with incomplete information with N \ge 2 players and arbitrary information structures. This characterization involves a new type of individual rational constraint linking the lowest equilibrium payoffs across players. The characterization is tight: we define a set of payoffs that contains all the belief-free equilibrium payoffs; conversely, any point in the interior of this set is a belief-free equilibrium payoff vector when players are sufficiently patient. Further, we provide necessary conditions and sufficient conditions on the information structure for this set to be non-empty, both for the case of known-own payoffs, and for arbitrary payoffs.
|Date of creation:||Oct 2009|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.econ.yale.edu/
More information through EDIRC
|Order Information:|| Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA|
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.:
- Takahashi, Satoru & Chassang, Sylvain, 2011. "Robustness to incomplete information in repeated games," Theoretical Economics, Econometric Society, vol. 6(1), January.
- Dirk Bergemann & Stephen Morris, 2007.
"Belief Free Incomplete Information Games,"
122247000000001569, UCLA Department of Economics.
When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:1739. 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: (Glena Ames)
If references are entirely missing, you can add them using this form.