Agreeing to agree with uncountable information structures
Given 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).
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:74:y:2012:i:1:p:442-446. 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: (Dana Niculescu)
If references are entirely missing, you can add them using this form.