Bounded Reasoning and Higher-Order Uncertainty
A standard assumption in game theory is that players have an infinite depth of reasoning: they think about what others think and about what others think that othersthink, and so on, ad infinitum. However, in practice, players may have a finite depth of reasoning. For example, a player may reason about what other players think, but not about what others think he thinks. This paper proposes a class of type spaces that generalizes the type space formalism due to Harsanyi (1967) so that it can model players with an arbitrary depth of reasoning. I show that the type space formalism does not impose any restrictions on the belief hierarchies that can be modeled, thus generalizing the classic result of Mertens and Zamir (1985). However, there is no universal type space that contains all type spaces.