Aumann (1976) put forward a formal definition of common knowledge and used it to prove that two "like minded" individuals cannot "agree to disagree" in the following sense. If they start from a common prior and update the probability of an event E (using Bayes' rule) on the basis of private information, then it cannot be common knowledge between them that individual 1 assigns probability p to E and individual 2 assigns probability q to E with p ¹ q. In other words, if their posteriors of event E are common knowledge then they must coincide. Aumann's Agreement Theorem has given rise to a large literature which we review in this paper. The results are classified according to whether they are probabilistic (Bayesian) or qualitative. Particular attention is paid to the issue of how to interpret the notion of Harsanyi consistency as a (local) property of belief hierarchies.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by California Davis - Department of Economics in its series Department of Economics with number
97-18.
Length: Date of creation: Date of revision: Handle: RePEc:fth:caldec:97-18
Contact details of provider: Postal: University of California Davis - Department of Economics. One Shields Ave., California 95616-8578 Phone: (530) 752-0741 Fax: (530) 752-9382 Email: Web page: http://www.econ.ucdavis.edu/ More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Thomas Krichel).
Related research
Keywords:
Cited by: (explanations, 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.)