Agreeing to agree with uncountable information structures
AbstractGiven the regularity condition on posteriors proposed in Lehrer and Samet (2011), we show that Lehrer and Sametʼs (2011) characterization of agreeing to agree in countable-information models cannot be extended to uncountable-information models. This answers an open question raised in Lehrer and Samet (2011).
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 74 (2012)
Issue (Month): 1 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Common knowledge; Common prior; Posterior;
Find related papers by JEL classification:
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
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.:
- Lehrer, Ehud & Samet, Dov, 2011.
"Agreeing to agree,"
Econometric Society, vol. 6(2), May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.