Hierarchy of beliefs
Construction by Jean-François Mertens and Zamir implementing with John Harsanyi's proposal to model games with incomplete information by supposing that each player is characterized by a privately known type that describes his feasible strategies and payoffs as well as a probability distribution over other players' types.[1] Such probability distribution at the first level can be interpreted as a low level belief of a player. One level up the probability on the belief of other players is interpreted as beliefs on beliefs. A recursive universal construct is built—in which player have beliefs on their beliefs at different level—this construct is called the hierarchy of beliefs.
The result is a universal space of types in which, subject to specified consistency conditions, each type corresponds to the infinite hierarchy of his probabilistic beliefs about others' probabilistic beliefs. They also showed that any subspace can be approximated arbitrarily closely by a finite subspace.
Another popular examples of the usage of the construction are the induction puzzles. And so is Robert Aumann's construction of common knowledge.[2]
References
- ↑ Jean -François Mertens and Shmuel Zamir (1985-03-01). "Formulation of Bayesian analysis for games with incomplete information". International Journal of Game Theory 14 (1): 1–29. doi:10.1007/BF01770224.
- ↑ Herbert Gintis (16 March 2009). The bounds of reason: game theory and the unification of the behavioral sciences. Princeton University Press. p. 158. ISBN 978-0-691-14052-0. https://books.google.com/books?id=an9MXLCYgw8C&pg=PA158. Retrieved 3 March 2012.
 |  |
