A coordination game with incomplete information is played through time. In each period, payoffs depend on a fundamental state and an additional idiosyncratic shock. Fundamentals evolve according to a random walk where the changes in fundamentals (namely common shocks) have a fat tailed...

This paper extends the framework of Kajii and Morris (1997) to study the question of robustness to incomplete information in repeated games. We show that dynamically robust equilibria can be characterized using a one-shot robustness principle that extends the one-shot deviation principle. Using...

In games with incomplete information, conventional hierarchies of belief are incomplete as descriptions of the players' information for the purposes of determining a player's behavior. We show by example that this is true for a variety of solution concepts. We then investigate what is essential...

In many experiments, the Nash equilibrium concept seems not to predict well. One reason may be that players have non-selfish preferences over outcomes. As a consequence, even when they are told what the material payoffs of the game are, mutual knowledge of preferences may not be satisfied. We...

We examine multistage information transmission with voluntary monetary transfer in the framework of Crawford and Sobel (1982). In our model, an informed expert can send messages to an uninformed decision maker more than once, and the uninformed decision maker can pay money to the informed expert...

We address the problem of a planner looking for the efficient network when agents play a network game with local complementarities and links are costly. We show that for general network cost functions, efficient networks belong to the class of Nested-Split Graphs. Next, we refine our results and...

We study the interaction between multiple information designers who try to influence the behavior of a set of agents. When the set of messages available to each designer is finite, such games always admit subgame perfect equilibria. When designers produce public information about independent...

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

We show that every Bayesian game with purely atomic types has a measurable Bayesian equilibrium when the common knowledge relation is smooth. Conversely, for any common knowledge relation that is not smooth, there exists a type space that yields this common knowledge relation and payoffs such...

This paper considers a population of agents that are engaged in a listening network. The agents wish to match their actions to the true value of some uncertain (exogenous) parameter and to the actions of the other agents. Each agent begins with some initial information about the parameter and,...