In an important paper, Weinstein and Yildiz (2007) show that if players have an infinite depth of reasoning and this is commonly believed, types generically have a unique rationalizable action in games that satisfy a richness condition. We show that this result does not extend to environments...

Consider a game where Alice generates an integer and Bob wins if he can factor that integer. Traditional game theory tells us that Bob will always win this game even though in practice Alice will win given our usual assumptions about the hardness of factoring. We define a new notion of bounded...

The standard framework for analyzing games with incomplete information models players as if they have an infinite depth of reasoning, which is not always consistent with experimental evidence. This paper generalizes the type spaces of Harsanyi (1967- 1968) so that players can have a nite depth...