Article ID: | iaor20002288 |
Country: | Germany |
Volume: | 28 |
Issue: | 3 |
Start Page Number: | 331 |
End Page Number: | 365 |
Publication Date: | Jan 1999 |
Journal: | International Journal of Game Theory |
Authors: | Halpern J.Y., Fagin R., Geanakoplos J., Vardi M.Y. |
One approach to representing knowledge or belief of agents, used by economists and computer scientists, involves an infinite hierarchy of beliefs. Such a hierarchy consists of an agent's beliefs about the state of the world, his beliefs about other agents' beliefs about the world, his beliefs about other agents' beliefs about the world, and so on. (Economists have typically modeled belief in terms of a probability distribution on the uncertainty space. In contrast, computer scientists have modeled belief in terms of a set of worlds, intuitively, the ones the agent considers possible.) We consider the question of when a countably infinite hierarchy completely describes the uncertainty of the agents. We provide various necessary and sufficient conditions for this property. It turns out that the probability-based approach can be viewed as satisfying one of these conditions, which explains why a countable hierarchy suffices in this case. These conditions also show that whether a countable hierarchy suffices may depend on the ‘richness’ of the states in the underlying state space. We also consider the question of whether a countable hierarchy suffices for ‘interesting’ sets of events, and show that the answer depends on the definition of ‘interesting’.