Dov Samet (Faculty of Mnangement Tel Aviv University)
Abstract
The type function of an agent, in a type space, associates with each state a probability distribution on the type space. Thus, a type function can be considered as a Markov chain on the state space. A common prior for the space turns out to be a probability distribution which is invariant under the type functions of all agents. Using the Markovian structure of type spaces we show that a necessary and sufficient condition for the existence of a common prior is that for each random variable it is common knowledge that all its joint averagings converge to the same value.
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
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Find related papers by JEL classification: C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory D8 - Microeconomics - - Information, Knowledge, and Uncertainty
References listed on IDEAS 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.:
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.)
Matthew O. Jackson & Ehud Kalai & Rann Smorodinsky, 1997.
"Patterns, Types, and Bayesian Learning,"
Discussion Papers
1177, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
[Downloadable!]