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...

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...

This paper presents a model that distinguishes between decentralized information processing and decentralized decision making in organizations; it shows that decentralized decision making can be advantageous due to computational delay, even in the absence of communication costs. The key feature...

We use a model of real-time decentralized information processing to understand how constraints on human information processing affect the returns to scale of organizations. We identify three informational (dis)economies of scale: diversification of heterogeneous risks (positive), sharing of...

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...

This is a draft of a chapter for a book called "Game Theory, 5 Questions," to be published by Automatic Pressed/VIP.Below are five questions and my answers. Any feedback is appreciated.

A central question in game theory and artificial intelligence is how a rational agent should behave in a complex environment, given that it cannot perform unbounded computations. We study strategic aspects of this question by formulating a simple model of a game with additional costs...