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

In John Nash’s proofs for the existence of (Nash) equilibria based on Brouwer’s theorem, an iteration mapping is used. A continuous- time analogue of the same mapping has been studied even earlier by Brown and von Neumann. This differential equation has recently been suggested as a plausible...

Our study analyzes theories of learning for strategic interactions in networks. Participants played two of the 2 x 2 games used by Selten and Chmura (2008) and in the comment by Brunner, Camerer and Goeree (2009). Every participant played against four neighbors and could choose a different...

Our study analyzes theories of learning for strategic interactions in networks. Participants played two of the 2 x 2 games used by Selten and Chmura (2008) and in the comment by Brunner, Camerer and Goeree (2009). Every participant played against four neighbors and could choose a different...

We study the impact of advice or observation on the depth of reasoning in an experimental beauty-contest game. Both sources of information trigger faster convergence to the equilibrium. Yet, we find that subjects who receive naive advice outperform uninformed subjects permanently, whereas...

We examine an Outside Option Game in which player I submits a claim for a share of a cake while player II simultaneously either makes a claim or chooses to opt out. If player II opts out, then she receives an opt-out payment while player I receives nothing. If player II opts in and if the claims...

We model a simple dynamic process in which boundedly rational agents learn through their interactions with others. Of interest is to study the process of contagion where by one action 'spreads throughout the population' and becomes conventional. We vary the network of player interaction between...

Our study analyzes theories of learning for strategic interactions in networks. Participants played two of the 2 x 2 games used by Selten and Chmura (2008). Every participant played against four neighbors and could choose a different strategy against each of them. The games were played in two...

We study behavior in repeated interactions when agents have no information about the structure of the underlying game and they cannot observe other agents' actions or payoffs. Theory shows that even when players have no such information, simple payoff-based learning rules eventually lead to...

Nash equilibrium takes optimization as a primitive, but suboptimal behavior can persist in simple stochastic decision problems. This has motivated the development of other equilibrium concepts such as cursed equilibrium and behavioral equilibrium. We experimentally study a simple adverse...