Agreeing to Disagree with Multiple Priors
We present an extension of Aumann's Agreement Theorem to the case of multiple priors. If agents update all their priors, then, for the Agreement Theorem to hold, it is sufficient to assume that they have closed, connected and intersecting sets of priors. On the other hand, if agents select the priors to be updated according to the maximum likelihood criterion, then, under these same assumptions, agents may still agree to disagree. For the Agreement Theorem to hold, it is also necessary to assume that the maximum likelihood priors are commonly known and not disjoint. To show that these hypotheses are necessary, we give several examples in which agents agree to disagree.
|Date of creation:||Apr 2010|
|Date of revision:|
|Contact details of provider:|| Postal: Rua Dr. Roberto Frias, 4200 PORTO|
Web page: http://www.fep.up.pt/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:por:fepwps:368. 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: ()
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.