A social choice correspondence (SCC) is virtually implementable if it is e-close (in the probability simplex) to some (exactly) implementable correspondence. Abreu and Sen (1991) proved that, without restriction on the set of alternatives receiving strictly positive probability at equilibrium,...

We construct an elementary mechanism (Dutta, Sen and Vohra (1995)) that Nash implements the Constrained Walrasian correspondence. We extend it to incomplete and non-exclusive information economies by enlarging the message space of agents. We characterize the set of Bayesian equilibrium outcomes...

Consider exchange economies in which preferences are continuous, convex and strongly monotonic. It is well known that the Walrasian correspondence is not Nash implementable. Maskin monotonicity (Maskin, 1999) is violated for allocations at the boundary of the feasible set. We derive an...

Consider the problem of exact Nash Implementation of social choice correspondences. Define a lottery mechanism as a mechanism in which the planner can randomize on alternatives out of equilibrium while pure alternatives are always chosen in equilibrium. When preferences over alternatives are...

We consider multiple-type housing markets. To capture the dynamic aspect of trade in such markets, we study a dynamic recontracting process similar to the one introduced by Serrano and Volij (2005). First, we analyze the set of recurrent classes of this process as a (non-empty) solution concept....