Finite allocation mechanisms: approximate Walrasian versus approximate Direct Revelation

This paper obtains finite counterparts of previous results that showed the informational efficiency of the Walrasian mechanism among all mechanisms yielding Pareto-optimal individually rational trades in exchange economies while using a continuum of possible messages. In particular, we develop finite counterparts of the superiority, with respect to message-space dimension, of the Walrasian mechanism over Direct Revelation (DR). We measure a finite mechanism's cost by the number of its (equilibrium) messages. Our two main results are as follows: (1) For exchange economies we find that the overall (maximum) error of a (sufficiently fine) approximate Walrasian mechanism is less than the overall error of a not-more-costly approximate DR mechanism whose equilibrium outcomes are trades that are (approximately) Pareto optimal and individually rational; more generally, approximate Walrasian mechanisms are superior, in the same sense, to approximations of any continuum mechanism whose outcomes are Pareto optimal individ ually rational trades and whose message space has higher dimension than that of the Walrasian mechanism. (2) As we increase without limit the dimension of the set of environments (characteristics) defining our class of exchange economies, the extra cost of DR approximations relative to Walrasian approximations, when both achieve the same overall error, also grows without limit. Thus the informational superiority of the Walrasian mechanism emerges again when we approximate it and take the finite number of messages in the approximation as our cost measure. Copyright Springer-Verlag Berlin Heidelberg 2003