This paper provides a noncooperative approach to core stability in an economy with incomplete information. The analysis covers general exchange economies, although our tightest results hold when effective coalitions consist of at most two players, as in matching. We study the perfect Bayesian...

We come close to characterizing the class of social choice correspondences that are implementable in rationalizable strategies. We identify a new condition, which we call set-monotonicity, and show that it is necessary and almost sufficient for rationalizable implementation. Set-monotonicity is...

Models of choice where agents see others as less sophisticated than themselves have significantly different, sometimes more accurate, predictions in games than does Nash equilibrium. When it comes to mechanism design, however, they turn out to have surprisingly similar implications. This paper...

We provide nonemptiness results of approximate interim cores with endogenous communication in large quasilinear economies, where every agent's informational size is small. We offer results for both replica and more general sequences of economies.

We provide a characterization of virtual Bayesian implementation in pure strategies for environments satisfying no-total-indifference. A social choice function in such environments is virtually Bayesian implementable if and only if it satisfies incentive compatibility and a condition we term...

We study a strategic model of dynamic trading where agents are asymmetrically informed over common value sources of uncertainty. There is a continuum of uninformed buyers and a finite number of sellers, some of them informed. When there is only one seller, full information revelation never...

It is well known that a social choice function is truthfully implementable in Bayesian Nash equilibrium if and only if it is incentive compatible. However, in general it is not possible to rule out other equilibrium outcomes, and additional conditions, e.g., Bayesian monotonicity, are needed to...

We consider robust virtual implementation, where robustness is the requirement that implementation succeed in all type spaces consistent with a given payoff type space as well as with a given space of first-order beliefs about the other agents’ payoff types. This last bit, which constitutes...