Common Priors and Markov Chains

Dov Samet

Game Theory and Information from University Library of Munich, Germany

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.

Keywords: Type spaces; prior; common prior; Markov chain (search for similar items in EconPapers)
JEL-codes: C7 D8 (search for similar items in EconPapers)
Pages: 8 pages
Date: 1996-10-21
Note: Type of Document - postscript; prepared on unix; pages: 8
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/9610/9610008.ps.gz (application/postscript)
https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/9610/9610008.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpga:9610008

Access Statistics for this paper

More papers in Game Theory and Information from University Library of Munich, Germany
Bibliographic data for series maintained by EconWPA ( this e-mail address is bad, please contact ).