Predictions under common knowledge of payoffs may differ from those under arbitrarily, but finitely, many orders of mutual knowledge; Rubinstein's (1989)Email game is a seminal example. Weinstein and Yildiz (2007) showed that the discontinuity in the example generalizes: for all types with...

We give a sufficient condition on the type space for revenue equivalence when the set of social alternatives consists of probability distributions over a finite set. Types are identified with real-valued functions that assign valuations to elements of this finite set, and the type space is...

We define and analyze a "strategic topology'' on types in the Harsanyi-Mertens-Zamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference...

A game of incomplete information can be decomposed into a basic game and an information structure. The basic game defines the set of actions, the set of payoff states the payoff functions and the common prior over the payoff states. The information structure refers to the signals that the...

We study large-population repeated games where players are symmetric but not anonymous, so player-specific rewards and punishments are feasible. Players may be commitment types who always take the same action. Even though players are not anonymous, we show that an anti-folk theorem holds when...

We analyze a cheap-talk model in which an informed sender and an uninformed receiver engage in a finite-period communication before the receiver chooses a project. During the communication phase, the sender sends a message in each period, and the receiver then voluntarily pays money for the...