Skip to main content
Social Sci LibreTexts

18.2: Myerson-Satterthwaite Theorem

  • Page ID
    43858
    • Anonymous
    • LibreTexts
    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)

    LEARNING OBJECTIVE

    1. Can information about values and costs that is not relevant to the other party be an impediment to trade?

    The lemons problem is a situation where the buyers are relatively uninformed and care about the information held by sellers. Lemons problems are limited to situations where the buyer isn’t well-informed, and these problems can be mitigated by making information public. In many transactions, the buyer knows the quality of the product, so lemons concerns aren’t a significant issue. There can still be a market failure, however, if there are a limited number of buyers and sellers.

    Consider the case of one buyer and one seller bargaining over the sale of a good. The buyer knows his own value v for the good, but not the seller’s cost. The seller knows her own cost c for the good, but not the buyer’s value. The buyer views the seller’s cost as uniformly distributed on the interval [0,1], and, similarly, the seller views the buyer’s value as uniformly distributed on [0,1].The remarkable fact proved by Roger Myerson and Mark Satterthwaite (“Efficient Mechanisms for Bilateral Trade,” Journal of Economic Theory 28 [1983]: 265–281) is that the distributions don’t matter; the failure of efficient trade is a fully general property. Philip Reny and Preston McAfee (“Correlated Information and Mechanism Design,” Econometrica 60, no. 2 [March 1992]: 395–421) show the nature of the distribution of information matters, and Preston McAfee (“Efficient Allocation with Continuous Quantities,” Journal of Economic Theory 53, no. 1 [February 1991]: 51–74.) showed that continuous quantities can overturn the Myerson-Satterthwaite theorem. Can efficient trade take place? Efficient trade requires that trade occurs whenever v > c, and the remarkable answer is that it is impossible to arrange efficient trade if the buyer and seller are to trade voluntarily. This is true even if a third party is used to help arrange trade, provided the third party isn’t able to subsidize the transaction.

    The total gains from trade under efficiency are \(\begin{equation}∫ 0 1 ∫ 0 v v−c dc dv= ∫ 0 1 v 2 2 dv= 1 6 .\end{equation}\)

    A means of arranging trade, known as a mechanism,A mechanism is a game for achieving an objective, in this case to arrange trades. asks the buyer and seller for their value and cost, respectively, and then orders trade if the value exceeds the cost and dictates a payment p by the buyer to the seller. Buyers need not make honest reports to the mechanism, however, and the mechanisms must be designed to induce the buyer and seller to report honestly to the mechanism so that efficient trades can be arranged.Inducing honesty is without loss of generality. Suppose that the buyer of type v reported the type z(v). Then we can add a stage to the mechanism in which the buyer reports a type, which is converted via the function z to a report, and then that report is given to the original mechanism. In the new mechanism, reporting v is tantamount to reporting z(v) to the original mechanism.

    Consider a buyer who actually has value v but reports a value r. The buyer trades with the seller if the seller has a cost less than r, which occurs with probability r.

    \begin{equation}u(r, v)=v r-E c p(r, c)\end{equation}

    The buyer gets the actual value v with probability r, and makes a payment that depends on the buyer’s report and the seller’s report. But we can take expectations over the seller’s report to eliminate it (from the buyer’s perspective), and this is denoted Ec p (r, c), which is just the expected payment given the report r. For the buyer to choose to be honest, u must be maximized at r = v for every v; otherwise, some buyers would lie and some trades would not be efficiently arranged. Thus, we can concludeWe maintain an earlier notation that the subscript refers to a partial derivative, so that if we have a function f, f1 is the partial derivative of f with respect to the first argument of \(\begin{equation}f. d dv u(v,v)= u 1 (v,v)+ u 2 (v,v)= u 2 (v,v)=r | r=v =v.\end{equation}\)

    The value u(v,v) is the gain accruing to a buyer with value v who reports having value v. Because the buyer with value 0 gets zero, the total gain accruing to the average buyer can be computed by integrating by parts \(\begin{equation}∫ 0 1 u(v,v) dv=−(1−v)u(v,v) | v=0 1 + ∫ 0 1 (1−v)( du dv ) dv= ∫ 0 1 (1−v)vdv = 1 6 .\end{equation}\)

    In the integration by parts, \(\begin{equation}dv = d – (1 – v)\end{equation}\) is used. The remarkable conclusion is that if the buyer is induced to truthfully reveal the buyer’s value, the buyer must obtain the entire gains from trade. This is actually a quite general proposition. If you offer the entire gains from trade to a party, that party is induced to maximize the gains from trade. Otherwise, he or she will want to distort away from maximizing the entire gains from trade, which will result in a failure of efficiency.

    The logic with respect to the seller is analogous: the only way to get the seller to report her cost honestly is to offer her the entire gains from trade.

    The Myerson-Satterthwaite theorem shows that private information about value may prevent efficient trade. Thus, the gains from trade are insufficient to induce honesty by both parties. (Indeed, they are half the necessary amount.) Thus, any mechanism for arranging trades between the buyer and the seller must suffer some inefficiency. Generally this occurs because buyers act like they value the good less than they do, and sellers act like their costs are higher than they truly are.

    It turns out that the worst-case scenario is a single buyer and a single seller. As markets get “thick,” the per capita losses converge to zero, and markets become efficient. Thus, informational problems of this kind are a small-numbers issue. However, many markets do in fact have small numbers of buyers or sellers. In such markets, it seems likely that informational problems will be an impediment to efficient trade.

    Key Takeaways

    • The Myerson-Satterthwaite theorem shows that the gains from trade are insufficient to induce honesty about values and costs by a buyer and seller. Any mechanism for arranging trades between the buyer and the seller must suffer some inefficiency.
    • Generally this inefficiency occurs because buyers act like they value the good less than they do, and sellers act like their costs are higher than they truly are, resulting in an inefficiently low level of trade.
    • As markets get “thick,” the per capita losses converge to zero, and markets become efficient. Informational problems of this kind are a small-numbers issue.

    EXERCISE

    1. Let h(r, c) be the gains of a seller who has cost c and reports r, \(\begin{equation}h(r, c) = p(v, r) – (1 – r)c.\end{equation}\)

      Noting that the highest cost seller (c = 1) never sells and thus obtains zero profits, show that honesty by the seller implies the expected value of h is 1/16.


    This page titled 18.2: Myerson-Satterthwaite Theorem is shared under a CC BY-NC-SA license and was authored, remixed, and/or curated by Anonymous.

    • Was this article helpful?