Myerson–Satterthwaite theorem

The Myerson–Satterthwaite theorem is an important result in mechanism design and the economics of asymmetric information, and named for Roger Myerson and Mark Satterthwaite.^[1] Informally, the result says that there is no efficient way for two parties to trade a good when they each have secret and probabilistically varying valuations for it, without the risk of forcing one party to trade at a loss.

The Myerson–Satterthwaite theorem is among the most remarkable and universally applicable negative results in economics—a kind of negative mirror to the fundamental theorems of welfare economics.^{[citation needed]} It is, however, much less famous than those results or Arrow's earlier result on the impossibility of satisfactory electoral systems.

There are two agents: Sally (the seller) and Bob (the buyer). Sally holds an item that is valuable for both her and Bob. Each agent values the item differently: Bob values it as ${\displaystyle v_{B}}$ and Sally as ${\displaystyle v_{S}}$. Each agent knows his/her own valuation with certainty, but knows the valuation of the other agent only probabilistically:

• For Sally, Bob's valuation is represented by a probability density function ${\displaystyle f_{B}}$ which is positive in the range ${\displaystyle [{\underline {B}},{\overline {B}}]}$. The corresponding cumulative distribution function is ${\displaystyle F_{B}}$.
• For Bob, Sally's valuation is represented by a probability density function ${\displaystyle f_{S}}$ which is positive in the range ${\displaystyle [{\underline {S}},{\overline {S}}]}$. The corresponding cumulative distribution function is ${\displaystyle F_{S}}$.

A direct bargaining mechanism is a mechanism which asks each agent to report his/her valuation of the item, then decides whether the item will be traded and at what price. Formally, it is represented by two functions:

• The trade-probability function, ${\displaystyle t(v'_{B},v'_{S})}$, determines the probability that the item will be transferred from the seller to the buyer (in a deterministic mechanism, this probability is either 0 or 1, but the formalism also allows random mechanisms).
• The price function, ${\displaystyle p(v'_{B},v'_{S})}$, determines the price that Bob should pay to Sally. Note that the reported values are marked by ${\displaystyle v'}$ since they do not equal the real values.

Note that, thanks to the revelation principle, the assumption that the mechanism is direct does not lose generality.

Every agent knows his value and knows the mechanism. Hence, every agent can calculate his expected gain from the trade. Since we are interested in mechanisms which are truthful in equilibrium, we assume that each agent assumes that the other agent is truthful. Hence:

• For Sally, the expected gain is the expected payment minus the expected loss from giving the object:

${\displaystyle U_{S}(v_{S},v'_{S})=\int _{u_{B}={\underline {B}}}^{\overline {B}}p(v'_{S},u_{B})f_{B}(u_{B})\,du_{B}-v_{S}\int _{u_{B}={\underline {B}}}^{\overline {B}}t(v'_{S},u_{B})f_{B}(u_{B})\,du_{B}}$

• For Bob, the expected gain is the expected gain from getting the object minus the expected payment:

${\displaystyle U_{B}(v_{B},v'_{B})=v_{B}\int _{u_{S}={\underline {S}}}^{\overline {S}}t(u_{S},v'_{B})f_{S}(u_{S})\,du_{S}-\int _{u_{S}={\underline {S}}}^{\overline {S}}p(u_{S},v'_{B})f_{S}(u_{S})\,du_{S}}$

Myerson and Satterthwaite study the following requirements that an ideal mechanism should satisfy.

1. Individual rationality (IR): The expected value of both Bob and Sally should be non-negative (so that they have an initial incentive to participate). Formally: ${\displaystyle U_{S}(v_{S},v_{S})\geq 0}$ and ${\displaystyle U_{B}(v_{B},v_{B})\geq 0}$.
2. Weak balanced budget (WBB): The auctioneer should not have to bring money from home in order to subsidize the trade.
3. Nash equilibrium incentive compatibility (NEIC): for every agent, if the other agent reports the true value, then the best response is to report the true value too. In other words, no one should want to lie. Formally: ${\displaystyle \forall v'_{s}:U_{S}(v_{S},v_{S})\geq U_{S}(v_{S},v'_{S})}$ and ${\displaystyle \forall v'_{B}:U_{B}(v_{B},v_{B})\geq U_{B}(v_{B},v'_{B})}$.
4. Ex-post Pareto efficiency (PE): the item should be finally given to the agent who values it the most. Formally: ${\displaystyle t(v_{B},v_{S})=1}$ if ${\displaystyle v_{B}>v_{S}}$ and ${\displaystyle t(v_{B},v_{S})=0}$ if ${\displaystyle v_{B}<v_{S}}$.

If the following two assumptions are true:

• The intervals ${\displaystyle [{\underline {B}},{\overline {B}}]}$ and ${\displaystyle [{\underline {S}},{\overline {S}}]}$ have a non-empty intersection.
• The probability densities for the valuations are strictly positive on those intervals.

then, there is no mechanism which satisfies the four properties mentioned above (IR, WBB, NEIC and PE).

Various variants of the Myerson–Satterthwaite setting have been studied.

1. Myerson and Satterthwaite considered a single buyer and a single seller. When there are many buyers and sellers, the inefficiency asymptotically disappears.^[2] However, this is only true in the case of private goods; in the case of public goods the inefficiency is aggravated when the number of agents becomes large.^[3][4]
2. Myerson and Satterthwaite considered an asymmetric initial situation, in the sense that at the outset one party has 100% of the good and the other party has 0% of the good. It has been shown that ex post efficiency can be attained if initially both parties own 50% of the good to be traded.^[5][6]
3. The latter result has been extended to settings in which the parties can make unobservable ex ante investments in order to increase their own valuations.^[7][8] Yet, ex post efficiency cannot be achieved if the seller's unobservable investment increases the buyer's valuation, even if only the buyer has private information about his or her valuation.^[9][10]
4. Another impossibility result where only one party has private information about its valuation can be shown to hold when the outside option payoffs are not exogenously given.^[11]

• Double auction