We formulate a notion of stable outcomes in matching problems with one‐sided asymmetric information. The key conceptual problem is to formulate a notion of a blocking pair that takes account of the inferences that the uninformed agent might make. We show that the set of stable outcomes is...

Consider two agents who learn the value of an unknown parameter by observing a sequence of private signals. The signals are independent and identically distributed across time but not necessarily across agents. We show that when each agent's signal space is finite, the agents will commonly learn...

We study the long-run sustainability of reputations in games with imperfect public monitoring. It is impossible to maintain a permanent reputation for playing a strategy that does not play an equilibrium of the game without uncertainty about types. Thus, a player cannot indefinitely sustain a...

'No trade' theorems have shown that new information will not lead to trade when agents share the same prior beliefs. This paper explores the structure of no trade theorems with heterogeneous prior beliefs. It is shown how different notions of efficiency under asymmetric information--ex ante,...

A number of papers have shown that a strict Nash equilibrium action profile of a game may never be played if there is a small amount of incomplete information. The authors present a general approach to analyzing the robustness of equilibria to a small amount of incomplete information. A Nash...

This paper elucidates on the logic behind recent papers which show that a unique equilibrium is selected in the presence of higher order uncertainty, i.e., when players lack common knowledge. We introduce two new concepts: stochastic potential of the information system and p-dominance of...

The mechanism design literature assumes too much common knowledge of the environment among the players and planner. We relax this assumption by studying mechanism design on richer type spaces. Copyright The Econometric Society 2005.