We experimentally assess the predictive power of two equilibrium selection principles for binary N-player entry games with strategic complementarities. In static entry games, we test the theory of global games which posits that players play games of complete information as if they were playing a...

We prove that for any equilibrium of a (Bayesian) game, and any sequence of perturbations of that game, there exists a corresponding sequence of ex-ante ε-equilibria converging to the given equilibrium of the original game. We strengthen the conclusion to show that the approaching equilibria...

We propose two characteristics of beliefs and study their role in shaping the set of rationalizable strategy profiles in games with incomplete information. The first characteristic, type-sensitivity, is related to how informative a player thinks his type is. The second characteristic, optimism,...

We study coordination in dynamic global games with private learning. Players choose whether and when to invest irreversibly in a project whose success depends on its quality and the timing of investment. Players gradually learn about project quality. We identify conditions on temporal incentives...

This paper investigates the role of endogenous timing of decisions on coordination under asymmetric information. In the equilibrium of a global coordination game, where players choose the timing of their decision, a player who has sufficiently high beliefs about the state of the economy...

In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players...

This paper studies supermodular mechanism design in environments with arbitrary (finite) type spaces and interdependent valuations. In these environments, the designer may have to use Bayesian equilibrium as a solution concept, because ex-post implementation may not be possible. We propose...

We study network games under strategic complementarities. Agents are embedded in a fixed network. They choose a positive, continuous action and interact with their network neighbors. Interactions are positive and actions are bounded from above. We first derive new sufficient conditions for...

A population of fully rational agents plays a symmetric 2-player game in biological fitnesses, but each agentʼs play is determined by his payoffs, which are free to evolve according to “survival of the fittest” pressures. An equilibrium-selection mechanism is assumed to exist, and deliver a...

This paper introduces a new coordination problem for a large but finite population – The Language Game. The population is partitioned into two groups of identical agents. Each player shares a common two-action strategy set and interacts pairwise with everyone else. Both symmetric profiles are...