We study learning with bounded memory in zero-sum repeated games with one-sided incomplete information. The uninformed player has only a fixed number of memory states available. His strategy is to choose a transition rule from state to state, and an action rule, which is a map from each memory...

We show that in multi-sender communication games where senders imperfectly observe the state, if the state space is large enough, then there can exist equilibria arbitrarily close to full revelation of the state as the noise in the senders' observations gets small. In the case of replacement...

In this paper we study market environments where information is costly to acquire and is also useful to potential competitors. Agents may sell, or buy, reports over the information acquired and choose their trades in the market on the basis of what they learnt. Reports are unverifiable – cheap...

We study how the predictive power of level-k models changes as we perturb the classical beauty contest setting along two dimensions: the strength of the coordination motive and the information symmetry. We use a variation of the Morris and Shin (2002) model as the unified framework for our...

We introduce a framework for modeling pairwise interactive beliefs and provide an epistemic foundation for Nash equilibrium in terms of pairwise epistemic conditions locally imposed on only some pairs of players. Our main result considerably weakens not only the standard sufficient conditions by...

We study a communication game of common interest in which the sender observes one of infinite types and sends one of finite messages which is interpreted by the receiver. In equilibrium there is no full separation but types are clustered into contiguous cells. We give a full characterization of...

In this paper we use a laboratory setting to manipulate our subjectsʼ beliefs about the cognitive levels of the players they are playing against. We show that in the context of the 2/3 guessing game, individual choices crucially depend on their beliefs about the level of others. Hence, a...

We study the probability that two or more agents can attain common knowledge of nontrivial events when the size of the state space grows large. We adopt the standard epistemic model where the knowledge of an agent is represented by a partition of the state space. Each agent is endowed with a...

We consider minimum-effort games played in an arbitrary network. For a family of imitation behavioral rules, including Imitate the Best and the Proportional Imitation Rule, we show that inefficient conventions arise independently of the interaction structure, if information is limited to the...

We revisit a result by Kim and Wong (2010) showing that under global interactions any strict Nash equilibrium of a coordination game can be supported as long run equilibrium by properly adding dominated strategies. We show that in the circular city model of local interactions and in the torus...