In this paper we will show how a message process which "realizes" (or computes) a given social choice rule F can be used to construct a game which implements F in Nash equilibrium. Any efficient encoding of information that occurs in the message process causes a corresponding reduction in the size of the strategy space of the game which we will construct to implement F. Necessary and (stronger) sufficient conditions on the message process will be given for this construction.

Strategic behavior in a finite market can cause inefficiency in the allocation, and market mechanisms differ in how successfully they limit this inefficiency. A method for ranking algorithms in computer science is adapted here to rank market mechanisms according to how quickly inefficiency diminishes as the size of the market increases. It is shown that trade at a single market-clearing price in the k-double auction is worst-case asymptotic optimal among all plausible mechanisms: evaluating mechanisms in their least favorable trading environments for each possible size of the market, the k-double auction is shown to force the worst-case inefficiency to zero at the fastest possible rate.

A model of trade with m buyers and m sellers is considered in which price is set to equate revealed demand and supply. In a Bayesian Nash equilibrium, each trader acts not as a price-taker, but instead misrepresents his true demand/supply to influence price in his favor. This causes inefficiency. We show that in any equilibrium the amount by which a trader misreports is O(1/m) and the corresponding inefficiency is O(1/m2). The indeterminacy and the inefficiency that is caused by the traders' bargaining behavior in small markets thus rapidly vanishes as the market increases in size.