Implementation of the Walrasian Correspondence: the Boundary Problem

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 in rev econ stud 66:23–38, 1999) is violated for walrasian allocations on the boundary of the feasible set. We derive an impossibility result showing that the walrasian correspondence is in fact not implementable in any of the solution concepts considered in the implementation literature. Next, imposing an additional domain restriction, we construct a sequential mechanism that doubly implements the walrasian correspondence in subgame perfect and strong subgame perfect equilibrium. The mechanism is based on price-allocation announcements, and it fits the very description of walrasian equilibrium. We thus take care of the boundary problem that was prominent in the nash implementation literature.