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

Rationalizability is a central concept in game theory. Since there may be many rationalizable strategies, applications commonly use refinements to obtain sharp predictions. In an important paper, Weinstein and Yildiz (2007) show that no refinement is robust to perturbations of high-order...

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

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

The standard framework for analyzing games with incomplete information models players as if they form beliefs about their opponents' beliefs about their opponents' beliefs and so on, that is, as if players have an infinite depth of reasoning. This strong assumption has nontrivial implications,...

We consider a general-sum N-player linear-quadratic game with stochastic dynamics over a finite horizon and prove the global convergence of the natural policy gradient method to the Nash equilibrium. In order to prove convergence of the method we require a certain amount of noise in the system....

We experimentally study how redistribution choices are affected by positive and negative information regarding the behaviour of a previous participant in a dictator game with a taking option. We use the strategy method to identify behavioural ‘types', and thus distinguish ‘conformists' from...

This study discusses the convergence to a solution in simultaneous-move games with unawareness. Since games with unawareness assume players' unawareness of actions, in some plays, players might revise their subjective views when they observe opponents' play, which they were unaware of. Recently,...

We study (interim correlated) rationalizability in a game with incomplete information. We characterize the recursive set of possible rationalizable hierarchies through a finite automaton and provide a revelation principle that characterizes the distributions over these hierarchies that arise...

This paper constructs a type space that contains all types with a finite depth of reasoning, as well as all types with an infinite depth of reasoning - in particular those types for whom finite-depth types are conceivable, or think that finite-depth types are conceivable in the mind of other...