Abstract:
Consider two agents who learn the value of an unknown parameter by observing a sequence of private signals. The signals are independent and identically distributed across time but not necessarily across agents. We show that that when each agent's signal space is finite, the agents will commonly learn its value, i.e., that the true value of the parameter will become approximate common-knowledge. In contrast, if the agents' observations come from a countably infinite signal space, then this contraction mapping property fails. We show by example that common learning can fail in this case.
Ordering information: This working paper can be ordered from Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA The price is None.
More papers in Cowles Foundation Discussion Papers from Cowles Foundation, Yale University Address: Yale University, Box 208281, New Haven, CT 06520-8281 USA Contact information at EDIRC. Series data maintained by Glena Ames ().
This site is part of RePEc
and all the data displayed here is part of the RePEc data set.
Is your work missing from RePEc? Here is how to
contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .