29. Two Problems in Trading Mechanism Design
29. Two Problems in Trading Mechanism Design
本章导读 上一章 [[bilateral-trade-impossibility]] 证明双边私人信息下事后有效的交易机制无法兼顾激励相容 (IC) 与个人理性 (IR)。本章在放松事后有效后讨论两个第二好问题,沿用 §28 的全部记号。§29.1 社会福利最大化问题:在 IC + IR 约束下最大化期望社会剩余 \(\mathbb{E}[\varphi(\theta_B-\theta_S)]\)。由定理 28.3,IC+IR 可行性等价于虚拟剩余约束 (29.3);由不可能性定理该约束在最优处必然取等(29.6)。拉格朗日法给出阈值解 \(\varphi_\lambda\) (29.7):只有当 \(\theta_B-\theta_S\ge\frac{\lambda}{1+\lambda}(\frac{1-F_B}{f_B}+\frac{F_S}{f_S})\) 时才交易,\(\lambda>0\) 由约束取等定出;注 29.1 交易的最小价差严格为正(该交易的有时不交易),注 29.2 解只由 \(\varphi\) 刻画(\(t\) 决定剩余分配、不唯一);例 29.1 均匀 $[0,1]$ 给 \(\lambda=\frac12\)、价差 \(\ge\frac14\) 才交易(图 30)。§29.2 平台利润最大化问题:平台向买家收 \(t_B\)、付卖家 \(t_S\),最大化 \(\mathbb{E}[t_B-t_S]\) (29.9)。由会计恒等式利润 = 总剩余 − 双方剩余 (29.10/注 29.3);代入 IC 刻画与命题 28.1,并令边界效用为零满足 IR,得阈值解 \(\varphi\) (29.14):\(\theta_B-\theta_S\ge\frac{1-F_B}{f_B}+\frac{F_S}{f_S}\) 才交易——等价于在福利解中令 \(\lambda\to\infty\),交易价差门槛更大;例 29.1 给价差 \(\ge\frac12\)(图 31)。图 30、31 已转述。
29. Two Problems in Trading Mechanism Design
Overview The previous chapter [[bilateral-trade-impossibility]] proved that under two-sided private information an ex-post efficient trading mechanism cannot also be incentive compatible (IC) and individually rational (IR). Relaxing ex-post efficiency, this chapter studies two second-best problems, reusing all the notation of §28. §29.1 the social welfare maximization problem: maximize expected social surplus \(\mathbb{E}[\varphi(\theta_B-\theta_S)]\) subject to IC + IR. By Theorem 28.3, IC+IR feasibility is equivalent to the virtual-surplus constraint (29.3); by the impossibility theorem this constraint must bind at the optimum (29.6). The Lagrangian gives a threshold solution \(\varphi_\lambda\) (29.7): trade only when \(\theta_B-\theta_S\ge\frac{\lambda}{1+\lambda}(\frac{1-F_B}{f_B}+\frac{F_S}{f_S})\), with \(\lambda>0\) pinned down by the binding constraint; Remark 29.1 the minimum gap for trade is strictly positive (sometimes no trade when there should be), Remark 29.2 the solution is characterized only by \(\varphi\) (\(t\) sets the surplus split and is not unique); Example 29.1 uniform $[0,1]$ gives \(\lambda=\frac12\) and trade only when the gap \(\ge\frac14\) (Figure 30). §29.2 the platform profit maximization problem: a platform collects \(t_B\) from the buyer and pays \(t_S\) to the seller, maximizing \(\mathbb{E}[t_B-t_S]\) (29.9). By the accounting identity profit = total surplus − both parties' surplus (29.10/Remark 29.3); substituting the IC characterization and Proposition 28.1, and setting the boundary utilities to zero for IR, gives a threshold solution \(\varphi\) (29.14): trade only when \(\theta_B-\theta_S\ge\frac{1-F_B}{f_B}+\frac{F_S}{f_S}\) — equivalent to taking \(\lambda\to\infty\) in the welfare solution, so the gap threshold is even larger; Example 29.1 gives a gap \(\ge\frac12\) (Figure 31). Figures 30 and 31 are paraphrased.
29.1 社会福利最大化问题 / Social welfare maximization problem
按定义 28.2,事后有效的交易机制 \(\varphi(\theta_B,\theta_S)=\mathbf 1\{\theta_B\ge\theta_S\}\) 最大化社会福利。但不可能性定理 28.4 告诉我们这种机制无法同时 IC 与 IR,故无法实现。于是我们退而求其次:在 IC + IR 约束下找最大化福利的交易机制 \(\{\varphi(\cdot,\cdot),t(\cdot,\cdot)\}\)。
29.1.1 问题 / The problem
福利最大化交易机制求解
$$\max_{\varphi(\cdot,\cdot)}\ \mathbb{E}_{\theta_B,\theta_S}[\varphi(\theta_B,\theta_S)(\theta_B-\theta_S)]\tag{29.1}$$
29.1 Social welfare maximization problem
By Definition 28.2 the ex-post efficient mechanism \(\varphi(\theta_B,\theta_S)=\mathbf 1\{\theta_B\ge\theta_S\}\) maximizes social welfare. But the impossibility theorem 28.4 tells us such a mechanism cannot be simultaneously IC and IR, so it cannot be implemented. We therefore settle for the second best: among all IC + IR mechanisms \(\{\varphi(\cdot,\cdot),t(\cdot,\cdot)\}\), find the one that maximizes welfare.
29.1.1 The problem
A welfare-maximizing trading mechanism solves
$$\max_{\varphi(\cdot,\cdot)}\ \mathbb{E}_{\theta_B,\theta_S}[\varphi(\theta_B,\theta_S)(\theta_B-\theta_S)]\tag{29.1}$$
约束为 \(\{\varphi(\cdot,\cdot),t(\cdot,\cdot)\}\) 激励相容且个人理性 (29.2)。我们假设 \(\bar\varphi_B(\cdot)\) 不减、\(\bar\varphi_S(\cdot)\) 不增(稍后验证)。由定理 28.3,只要
$$\mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\Big(\big(\theta_B-\tfrac{1-F_B(\theta_B)}{f_B(\theta_B)}\big)-\big(\theta_S+\tfrac{F_S(\theta_S)}{f_S(\theta_S)}\big)\Big)\right]\ge0\tag{29.3}$$
成立,就存在 \(t(\cdot,\cdot)\) 使 \(\{\varphi,t\}\) 既 IC 又 IR。于是约束 (29.2) 可由 (29.3) 替代。
The constraint is that \(\{\varphi(\cdot,\cdot),t(\cdot,\cdot)\}\) be incentive compatible and individually rational (29.2). We assume \(\bar\varphi_B(\cdot)\) is non-decreasing and \(\bar\varphi_S(\cdot)\) non-increasing (checked later). By Theorem 28.3, as long as
$$\mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\Big(\big(\theta_B-\tfrac{1-F_B(\theta_B)}{f_B(\theta_B)}\big)-\big(\theta_S+\tfrac{F_S(\theta_S)}{f_S(\theta_S)}\big)\Big)\right]\ge0\tag{29.3}$$
holds, there exists \(t(\cdot,\cdot)\) making \(\{\varphi,t\}\) both IC and IR. So constraint (29.2) can be replaced by (29.3).
约束必然取等 / The constraint must bind 由不可能性定理 28.4,对有效且 IC、IR 的机制 \(\{\varphi(\cdot,\cdot),t(\cdot,\cdot)\}\),(29.1) 与 (29.3) 的解必使 (29.3) 取等。反证:若最优 \(\hat\varphi\) 使 (29.3) 严格大于零(\(\mathbb{E}[\hat\varphi(\dots)]>0\),即 (29.4)),则由连续性必存在更靠近事后有效 \(\varphi^\star(\cdot,\cdot)=\mathbf 1\{\theta_B\ge\theta_S\}\) 的机制 \(\tilde\varphi\)(在更多点 \((\theta_B,\theta_S)\) 上 \(\tilde\varphi=\varphi^\star\))仍满足 (29.4)、仍 IC 且 IR;但 \(\tilde\varphi\) 更靠近事后有效机制就产生更高社会剩余,与 \(\hat\varphi\) 解 (29.1)&(29.3) 矛盾。故 (29.3) 在最优处取等。By the impossibility theorem 28.4, for an efficient IC and IR mechanism \(\{\varphi(\cdot,\cdot),t(\cdot,\cdot)\}\), the solution to (29.1) and (29.3) must make (29.3) bind. By contradiction: if the optimal \(\hat\varphi\) made (29.3) strictly positive (\(\mathbb{E}[\hat\varphi(\dots)]>0\), i.e. (29.4)), then by continuity there exists a mechanism \(\tilde\varphi\) closer to the ex-post efficient \(\varphi^\star(\cdot,\cdot)=\mathbf 1\{\theta_B\ge\theta_S\}\) (with \(\tilde\varphi=\varphi^\star\) at more points \((\theta_B,\theta_S)\)) that still satisfies (29.4) and is still IC and IR; but being closer to the ex-post efficient mechanism, \(\tilde\varphi\) generates higher social surplus, contradicting that \(\hat\varphi\) solves (29.1)&(29.3). Hence (29.3) binds at the optimum.
于是福利最大化问题改写为
So the welfare maximization problem can be rewritten as
$$\max_{\varphi(\cdot,\cdot)}\ \mathbb{E}_{\theta_B,\theta_S}[\varphi(\theta_B,\theta_S)(\theta_B-\theta_S)]\tag{29.5}$$
$$\text{s.t.}\quad \mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\Big(\big(\theta_B-\tfrac{1-F_B(\theta_B)}{f_B(\theta_B)}\big)-\big(\theta_S+\tfrac{F_S(\theta_S)}{f_S(\theta_S)}\big)\Big)\right]=0\tag{29.6}$$
29.1.2 求解 / The solution
为 (29.5)、(29.6) 构造拉格朗日函数(约束取等、乘子 \(\lambda>0\)):
29.1.2 The solution
Form the Lagrangian for (29.5), (29.6) (the constraint binds, so the multiplier \(\lambda>0\)):
$$\mathcal L=\mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\Big((\theta_B-\theta_S)+\lambda\big((\theta_B-\tfrac{1-F_B(\theta_B)}{f_B(\theta_B)})-(\theta_S+\tfrac{F_S(\theta_S)}{f_S(\theta_S)})\big)\Big)\right]$$
提取公因子 \((1+\lambda)\) 并整理括号内系数,得
Factoring out \((1+\lambda)\) and collecting the bracket coefficients gives
$$\mathcal L=(1+\lambda)\,\mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\Big((\theta_B-\theta_S)-\tfrac{\lambda}{1+\lambda}\big(\tfrac{1-F_B(\theta_B)}{f_B(\theta_B)}+\tfrac{F_S(\theta_S)}{f_S(\theta_S)}\big)\Big)\right]$$
逐点(对每个 \((\theta_B,\theta_S)\))最大化:被乘项为正则取 \(\varphi=1\)、否则 \(\varphi=0\),即
Maximizing point-wise (for each \((\theta_B,\theta_S)\)): set \(\varphi=1\) when the multiplied term is positive and \(\varphi=0\) otherwise, i.e.
$$\varphi_\lambda(\theta_B,\theta_S)=\begin{cases}1 & \text{if } (\theta_B-\theta_S)\ge\frac{\lambda}{1+\lambda}\big(\frac{1-F_B(\theta_B)}{f_B(\theta_B)}+\frac{F_S(\theta_S)}{f_S(\theta_S)}\big)\\[4pt]0 & \text{if } (\theta_B-\theta_S)<\frac{\lambda}{1+\lambda}\big(\frac{1-F_B(\theta_B)}{f_B(\theta_B)}+\frac{F_S(\theta_S)}{f_S(\theta_S)}\big)\end{cases}\tag{29.7}$$
由 (29.7),在正则性条件下(\(\theta_B-\frac{\lambda}{1+\lambda}\frac{1-F_B(\theta_B)}{f_B(\theta_B)}\) 关于 \(\theta_B\) 不减、\(\theta_S+\frac{\lambda}{1+\lambda}\frac{F_S(\theta_S)}{f_S(\theta_S)}\) 关于 \(\theta_S\) 不减)\(\varphi_\lambda\) 关于 \(\theta_B\) 不减、关于 \(\theta_S\) 不增,与先前假设相符。
From (29.7), under regularity conditions (\(\theta_B-\frac{\lambda}{1+\lambda}\frac{1-F_B(\theta_B)}{f_B(\theta_B)}\) non-decreasing in \(\theta_B\) and \(\theta_S+\frac{\lambda}{1+\lambda}\frac{F_S(\theta_S)}{f_S(\theta_S)}\) non-decreasing in \(\theta_S\)), \(\varphi_\lambda\) is non-decreasing in \(\theta_B\) and non-increasing in \(\theta_S\), consistent with the earlier assumption.
注 29.1、注 29.2 / Remarks 29.1, 29.2 注 29.1:交易发生所需的最小价差 \(\theta_B-\theta_S\) 严格为正:\(0<\theta_B-\theta_S<\frac{\lambda}{1+\lambda}(\frac{1-F_B(\theta_B)}{f_B(\theta_B)}+\frac{F_S(\theta_S)}{f_S(\theta_S)})\) 这一带状区域内该交易却不交易——可行(IC+IR)的福利最大化机制有时不能实现本应发生的交易。注 29.2:解仅由 \(\varphi(\cdot,\cdot)\) 刻画,因 \(t(\cdot,\cdot)\) 只决定剩余在买卖双方间的分配份额,并不唯一。Remark 29.1: the minimum gap \(\theta_B-\theta_S\) required for trade is strictly positive: in the band \(0<\theta_B-\theta_S<\frac{\lambda}{1+\lambda}(\frac{1-F_B(\theta_B)}{f_B(\theta_B)}+\frac{F_S(\theta_S)}{f_S(\theta_S)})\) trade should happen but doesn't — the feasible (IC+IR) welfare-maximizing mechanism sometimes fails to realize trades that should occur. Remark 29.2: the solution is characterized only by \(\varphi(\cdot,\cdot)\), since \(t(\cdot,\cdot)\) merely determines the share of surplus distributed between the two sides and is not unique.
\(\lambda\) 由 (29.7) 代回约束 (29.6)(取等)定出:
\(\lambda\) is pinned down by substituting (29.7) into the (binding) constraint (29.6):
$$\mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi_\lambda(\theta_B,\theta_S)\Big((\theta_B-\tfrac{1-F_B(\theta_B)}{f_B(\theta_B)})-(\theta_S+\tfrac{F_S(\theta_S)}{f_S(\theta_S)})\Big)\right]=0$$
例 29.1(均匀分布 / Uniform distribution) 设 \(\theta_B,\theta_S\) 独立同服从 $[0,1]$ 上的均匀分布。则 \(\frac{1-F_B(\theta_B)}{f_B(\theta_B)}=1-\theta_B\)、\(\frac{F_S(\theta_S)}{f_S(\theta_S)}=\theta_S\),故 (29.7) 的门槛 \(\frac{\lambda}{1+\lambda}(1-\theta_B+\theta_S)\)。化简交易条件 \(\theta_B-\theta_S\ge\frac{\lambda}{1+\lambda}(1-(\theta_B-\theta_S))\) 得Let \(\theta_B,\theta_S\) be i.i.d. uniform on $[0,1]\(. Then \)\frac{1-F_B(\theta_B)}{f_B(\theta_B)}=1-\theta_B$ and \(\frac{F_S(\theta_S)}{f_S(\theta_S)}=\theta_S\), so the threshold in (29.7) is \(\frac{\lambda}{1+\lambda}(1-\theta_B+\theta_S)\). Simplifying the trade condition \(\theta_B-\theta_S\ge\frac{\lambda}{1+\lambda}(1-(\theta_B-\theta_S))\) gives
$$\varphi_\lambda(\theta_B,\theta_S)=\begin{cases}1 & \text{if } (\theta_B-\theta_S)\ge\frac{\lambda}{1+2\lambda}\\[4pt]0 & \text{if } (\theta_B-\theta_S)<\frac{\lambda}{1+2\lambda}\end{cases}\tag{29.8}$$
把 (29.8) 代回 (29.6) 求 \(\lambda\):经多步积分化简(\(\int_{\frac{\lambda}{1+2\lambda}}^1\dots d\theta_B=0\))最终得 \(\frac{\lambda}{1+2\lambda}=\frac14\),即 \(\lambda=\frac12\)。于是本例中只有当 \(\theta_B-\theta_S\ge\frac14\) 时才交易。Substituting (29.8) into (29.6) to solve for \(\lambda\): after several integration steps (\(\int_{\frac{\lambda}{1+2\lambda}}^1\dots d\theta_B=0\)) one obtains \(\frac{\lambda}{1+2\lambda}=\frac14\), i.e. \(\lambda=\frac12\). So in this example trade happens only when \(\theta_B-\theta_S\ge\frac14\).
图 30(已转述 / Figure 30, paraphrased) 在 \((\theta_B,\theta_S)\in[0,1]^2\) 的单位正方形中画两条平行线:对角线 \(\theta_S=\theta_B\) 与下移直线 \(\theta_S=\theta_B-\frac14\)。区域 \(A\)+区域 \(B\)(对角线下方整片 \(\{\theta_S\le\theta_B\}\))是事后有效机制下该交易的点集;区域 \(B\) 单独(\(\theta_S\le\theta_B-\frac14\))是福利最大化机制下实际交易的点集。两者之差(\(\theta_B-\frac14<\theta_S\le\theta_B\) 的窄带 \(A\))即被牺牲掉的本应发生的交易。In the unit square \((\theta_B,\theta_S)\in[0,1]^2\), draw two parallel lines: the diagonal \(\theta_S=\theta_B\) and the shifted line \(\theta_S=\theta_B-\frac14\). Region \(A\) + region \(B\) (the whole area below the diagonal, \(\{\theta_S\le\theta_B\}\)) is the set where trade should happen under the ex-post efficient mechanism; region \(B\) alone (\(\theta_S\le\theta_B-\frac14\)) is the set where trade actually happens under the welfare-maximizing mechanism. The difference (the narrow band \(A\) with \(\theta_B-\frac14<\theta_S\le\theta_B\)) is the socially desirable trade that is sacrificed.
29.2 平台利润最大化问题 / Profit maximization problem
现设有一平台,向买家收取 \(t_B(\theta_B,\theta_S)\)、向卖家支付 \(t_S(\theta_B,\theta_S)\),其中 \(t_B(\theta_B,\theta_S)>t_S(\theta_B,\theta_S)\)。我们关心最大化平台利润 \(t_B(\theta_B,\theta_S)-t_S(\theta_B,\theta_S)\) 的交易机制。沿用 §28 中 \(\bar\varphi_B,\bar\varphi_S,\bar t_B,\bar t_S,U_B,U_S\) 等记号。
29.2.1 问题 / The problem
平台利润最大化交易机制求解
$$\max_{t_B(\cdot),\,t_S(\cdot)}\ \mathbb{E}_{\theta_B,\theta_S}[t_B(\theta_B)-t_S(\theta_S)]\tag{29.9}$$
29.2 Profit maximization problem
Now suppose there is a platform that collects \(t_B(\theta_B,\theta_S)\) from the buyer and pays \(t_S(\theta_B,\theta_S)\) to the seller, with \(t_B(\theta_B,\theta_S)>t_S(\theta_B,\theta_S)\). We want the trading mechanism that maximizes the platform's profit \(t_B(\theta_B,\theta_S)-t_S(\theta_B,\theta_S)\). We keep the notation \(\bar\varphi_B,\bar\varphi_S,\bar t_B,\bar t_S,U_B,U_S\) from §28.
29.2.1 The problem
A platform-profit-maximizing trading mechanism solves
$$\max_{t_B(\cdot),\,t_S(\cdot)}\ \mathbb{E}_{\theta_B,\theta_S}[t_B(\theta_B)-t_S(\theta_S)]\tag{29.9}$$
利用利润 = 总剩余 − 双方剩余,可等价改写为
$$\Leftrightarrow\ \max_{\varphi(\cdot),\,t_B(\cdot),\,t_S(\cdot)}\ \mathbb{E}_{\theta_B,\theta_S}[\varphi(\theta_B,\theta_S)(\theta_B-\theta_S)-U_B(\theta_B)-U_S(\theta_S)]\tag{29.10}$$
约束为 \(\{\varphi(\cdot,\cdot),t_B(\cdot,\cdot),t_S(\cdot,\cdot)\}\) 个人理性(IR)。
Using profit = total surplus − both parties' surplus, this is equivalently
$$\Leftrightarrow\ \max_{\varphi(\cdot),\,t_B(\cdot),\,t_S(\cdot)}\ \mathbb{E}_{\theta_B,\theta_S}[\varphi(\theta_B,\theta_S)(\theta_B-\theta_S)-U_B(\theta_B)-U_S(\theta_S)]\tag{29.10}$$
subject to \(\{\varphi(\cdot,\cdot),t_B(\cdot,\cdot),t_S(\cdot,\cdot)\}\) being individually rational (IR).
注 29.3(会计恒等式 / Remark 29.3: accounting identity) \(\mathbb{E}[t_B(\theta_B)-t_S(\theta_S)]=\mathbb{E}[\varphi(\theta_B,\theta_S)(\theta_B-\theta_S)-U_B(\theta_B)-U_S(\theta_S)]\) 恒成立:平台利润等于全部产生的剩余减去买卖双方各自的剩余,是一个会计恒等式。\(\mathbb{E}[t_B(\theta_B)-t_S(\theta_S)]=\mathbb{E}[\varphi(\theta_B,\theta_S)(\theta_B-\theta_S)-U_B(\theta_B)-U_S(\theta_S)]\) always holds: the platform's profit equals the total generated surplus minus the surplus of both seller and buyer — an accounting identity.
29.2.2 求解 / The solution
由定理 28.1,\(\{\varphi(\cdot,\cdot),t_B(\cdot,\cdot),t_S(\cdot,\cdot)\}\) 激励相容当且仅当 (1) \(\bar\varphi_B(\cdot)\) 不减、\(\bar\varphi_S(\cdot)\) 不增;(2) \(U_B(\theta_B)=U_B(\underline\theta_B)+\int_{\underline\theta_B}^{\theta_B}\bar\varphi_B(x)dx\)、\(U_S(\theta_S)=U_S(\overline\theta_S)+\int_{\theta_S}^{\overline\theta_S}\bar\varphi_S(x)dx\)(注 29.4:由注 28.2,(2) 等价于对 \(t_B,t_S\) 的条件 (2)',故可直接代入 (29.9))。
Remark 29.3: accounting identity \(\mathbb{E}[t_B(\theta_B)-t_S(\theta_S)]=\mathbb{E}[\varphi(\theta_B,\theta_S)(\theta_B-\theta_S)-U_B(\theta_B)-U_S(\theta_S)]\) 恒成立:平台利润等于全部产生的剩余减去买卖双方各自的剩余,是一个会计恒等式。\(\mathbb{E}[t_B(\theta_B)-t_S(\theta_S)]=\mathbb{E}[\varphi(\theta_B,\theta_S)(\theta_B-\theta_S)-U_B(\theta_B)-U_S(\theta_S)]\) always holds: the platform's profit equals the total generated surplus minus the surplus of both seller and buyer — an accounting identity.
29.2.2 The solution
By Theorem 28.1, \(\{\varphi(\cdot,\cdot),t_B(\cdot,\cdot),t_S(\cdot,\cdot)\}\) is incentive compatible if and only if (1) \(\bar\varphi_B(\cdot)\) is non-decreasing and \(\bar\varphi_S(\cdot)\) non-increasing; (2) \(U_B(\theta_B)=U_B(\underline\theta_B)+\int_{\underline\theta_B}^{\theta_B}\bar\varphi_B(x)dx\) and \(U_S(\theta_S)=U_S(\overline\theta_S)+\int_{\theta_S}^{\overline\theta_S}\bar\varphi_S(x)dx\) (Remark 29.4: by Remark 28.2, (2) is equivalent to a condition (2)' on \(t_B,t_S\), so one can directly substitute into (29.9)).
由命题 28.1,
$$\mathbb{E}_{\theta_B}[U_B(\theta_B)]=U_B(\underline\theta_B)+\mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\tfrac{1-F_B(\theta_B)}{f_B(\theta_B)}\right]\tag{29.11}$$
$$\mathbb{E}_{\theta_S}[U_S(\theta_S)]=U_S(\overline\theta_S)+\mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\tfrac{F_S(\theta_S)}{f_S(\theta_S)}\right]\tag{29.12}$$
将 (29.11)、(29.12) 代入 (29.10),并令 \(U_B(\underline\theta_B)=U_S(\overline\theta_S)=0\)(恰好满足 IR),问题化为
By Proposition 28.1,
$$\mathbb{E}_{\theta_B}[U_B(\theta_B)]=U_B(\underline\theta_B)+\mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\tfrac{1-F_B(\theta_B)}{f_B(\theta_B)}\right]\tag{29.11}$$
$$\mathbb{E}_{\theta_S}[U_S(\theta_S)]=U_S(\overline\theta_S)+\mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\tfrac{F_S(\theta_S)}{f_S(\theta_S)}\right]\tag{29.12}$$
Substituting (29.11), (29.12) into (29.10) and setting \(U_B(\underline\theta_B)=U_S(\overline\theta_S)=0\) (which exactly satisfies IR), the problem becomes
$$\max_{\varphi(\cdot,\cdot)}\ \mathbb{E}_{\theta_B,\theta_S}\!\left[\varphi(\theta_B,\theta_S)\Big((\theta_B-\tfrac{1-F_B(\theta_B)}{f_B(\theta_B)})-(\theta_S+\tfrac{F_S(\theta_S)}{f_S(\theta_S)})\Big)\right]\tag{29.13}$$
逐点最大化得阈值解
Point-wise maximization gives the threshold solution
$$\varphi(\theta_B,\theta_S)=\begin{cases}1 & \text{if } (\theta_B-\theta_S)\ge\big(\frac{1-F_B(\theta_B)}{f_B(\theta_B)}+\frac{F_S(\theta_S)}{f_S(\theta_S)}\big)\\[4pt]0 & \text{if } (\theta_B-\theta_S)<\big(\frac{1-F_B(\theta_B)}{f_B(\theta_B)}+\frac{F_S(\theta_S)}{f_S(\theta_S)}\big)\end{cases}\tag{29.14}$$
平台解 = 福利解令 \(\lambda\to\infty\) / Platform solution = welfare solution with \(\lambda\to\infty\) 平台利润最大化解 (29.14) 等价于在福利最大化解 (29.7) 中令 \(\lambda=\infty\)(此时 \(\frac{\lambda}{1+\lambda}=1\))。故平台利润最大化机制要求更大的价差 \(\theta_B-\theta_S\) 才交易——比福利最大化机制牺牲掉更多本应发生的交易。直觉:平台为攫取自身利润压低买家、抬高卖家的有效报价,把交易门槛进一步抬高。The platform-profit-maximizing solution (29.14) is equivalent to setting \(\lambda=\infty\) in the welfare-maximizing solution (29.7) (so that \(\frac{\lambda}{1+\lambda}=1\)). Hence the platform mechanism requires an even larger gap \(\theta_B-\theta_S\) before trade occurs — sacrificing even more socially desirable trade than the welfare mechanism. Intuition: to extract its own profit the platform marks the buyer down and the seller up, pushing the trade threshold still higher.
例 29.1(续,均匀分布 / continued, uniform) 仍设 \(\theta_B,\theta_S\) 独立同服从 $[0,1]$。则 \(\frac{1-F_B(\theta_B)}{f_B(\theta_B)}+\frac{F_S(\theta_S)}{f_S(\theta_S)}=(1-\theta_B)+\theta_S=1-(\theta_B-\theta_S)\)。由 (29.14),交易条件 \(\theta_B-\theta_S\ge1-(\theta_B-\theta_S)\) 即 \(\theta_B-\theta_S\ge\frac12\):Again let \(\theta_B,\theta_S\) be i.i.d. uniform on $[0,1]\(. Then \)\frac{1-F_B(\theta_B)}{f_B(\theta_B)}+\frac{F_S(\theta_S)}{f_S(\theta_S)}=(1-\theta_B)+\theta_S=1-(\theta_B-\theta_S)\(. By (29.14), the trade condition \)\theta_B-\theta_S\ge1-(\theta_B-\theta_S)$ becomes \(\theta_B-\theta_S\ge\frac12\):
$$\varphi(\theta_B,\theta_S)=\begin{cases}1 & \text{if } (\theta_B-\theta_S)\ge\frac12\\[4pt]0 & \text{if } (\theta_B-\theta_S)<\frac12\end{cases}$$
图 31(已转述 / Figure 31, paraphrased) 在单位正方形中画三条平行线:对角线 \(\theta_S=\theta_B\)、\(\theta_S=\theta_B-\frac14\)、\(\theta_S=\theta_B-\frac12\)。区域 \(A\)+\(B\)+\(C\)(整片 \(\{\theta_S\le\theta_B\}\))是事后有效机制下该交易的点集;区域 \(B\)+\(C\)(\(\theta_S\le\theta_B-\frac14\))是福利最大化机制下实际交易的点集;区域 \(C\) 单独(\(\theta_S\le\theta_B-\frac12\))是平台利润最大化机制下实际交易的点集。门槛随"有效 → 福利最大 → 平台利润最大"逐级抬高,交易越来越少。In the unit square draw three parallel lines: the diagonal \(\theta_S=\theta_B\), \(\theta_S=\theta_B-\frac14\), and \(\theta_S=\theta_B-\frac12\). Region \(A\)+\(B\)+\(C\) (the whole area \(\{\theta_S\le\theta_B\}\)) is the set where trade should happen under the ex-post efficient mechanism; region \(B\)+\(C\) (\(\theta_S\le\theta_B-\frac14\)) is where trade actually happens under the welfare-maximizing mechanism; region \(C\) alone (\(\theta_S\le\theta_B-\frac12\)) is where trade actually happens under the platform-profit-maximizing mechanism. The threshold rises step by step as "efficient → welfare-max → platform-profit-max", with less and less trade.
参考文献 / References
- Myerson, R., & Satterthwaite, M. (1983). Efficient Mechanisms for Bilateral Trading. Journal of Economic Theory, 29(2), 265-281.(第二好交易机制的母本)
- 本章承接 [[bilateral-trade-impossibility]](Ch 28)的不可能性定理与定理 28.1、28.3、命题 28.1;下一章 [[efficient-outcome-implementation]](Ch 30)转入多人环境下有效结果的实现(VCG / Groves 机制)。
References
- Myerson, R., & Satterthwaite, M. (1983). Efficient Mechanisms for Bilateral Trading. Journal of Economic Theory, 29(2), 265-281. (the basis for second-best trading mechanisms)
- This chapter follows the impossibility theorem and Theorems 28.1, 28.3, and Proposition 28.1 of [[bilateral-trade-impossibility]] (Ch 28); the next chapter [[efficient-outcome-implementation]] (Ch 30) turns to implementing the efficient outcome with more than two players (VCG / Groves mechanisms).