pith. sign in

arxiv: 2606.03849 · v1 · pith:YQDEWPXSnew · submitted 2026-06-02 · 💻 cs.GT

Second-Best Bilateral Trade is 1/2 Efficient

Zhengyang Liu , Ying Qin , Zeyu Ren , Zihe Wang This is my paper

Pith reviewed 2026-06-28 07:49 UTC · model grok-4.3

classification 💻 cs.GT
keywords bilateral trademechanism designsecond-best mechanismgains from tradeefficiency ratioincentive compatibilitybudget balance
0
0 comments X

The pith

The Bayesian-optimal mechanism for bilateral trade always achieves at least half the first-best gains from trade.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Bilateral trade between a buyer and seller cannot reach full efficiency under the requirements of incentive compatibility, individual rationality, and budget balance. The paper establishes that the best mechanism satisfying these constraints still secures at least half the total gains that would be possible if those constraints were ignored. The factor of one half is tight, so some value distributions force the mechanism to stop exactly at that level. This supplies a precise worst-case guarantee on how much efficiency must be left on the table in any realistic bilateral-trade setting.

Core claim

The Bayesian-optimal (second-best) mechanism always captures at least half of the first-best gains from trade (SB ≥ 1/2 FB). This result is tight.

What carries the argument

The second-best mechanism: the Bayesian incentive-compatible, individually rational, and strongly budget-balanced rule that maximizes expected gains from trade.

If this is right

  • For any independent value distributions the ratio of second-best to first-best welfare is at least one half.
  • There exist distributions in which the ratio equals exactly one half.
  • The guarantee improves on all previously published lower bounds for the same setting.
  • The upper bound of one half on the worst-case ratio is now known to be tight.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Designers facing unknown distributions can safely use any second-best mechanism while knowing the efficiency loss is bounded by a factor of two.
  • The same ratio bound may serve as a benchmark when extending the model to more than two traders.
  • Exact computation of the ratio for concrete distributions becomes feasible once the half bound is established.

Load-bearing premise

Buyer and seller values are drawn independently from known distributions, and any mechanism must satisfy Bayesian incentive compatibility, individual rationality, and strong budget balance.

What would settle it

A pair of distributions for which the optimal mechanism extracts strictly less than half the first-best gains from trade would disprove the claim.

Figures

Figures reproduced from arXiv: 2606.03849 by Ying Qin, Zeyu Ren, Zhengyang Liu, Zihe Wang.

Figure 1
Figure 1. Figure 1: Schematic illustration of the proof of Theorem [PITH_FULL_IMAGE:figures/full_fig_p020_1.png] view at source ↗
read the original abstract

The landmark Myerson-Satterthwaite Theorem establishes a fundamental impossibility in bilateral trade: no Bayesian incentive-compatible mechanism can simultaneously achieve ex-post efficiency, individual rationality, and strong budget balance. We resolve a long-standing open question regarding the efficiency loss imposed by these constraints. Specifically, we prove that the Bayesian-optimal (second-best) mechanism always captures at least half of the first-best gains from trade ($\mathrm{SB}\ge\frac{1}{2}\mathrm{FB}$). This result is tight, definitively closing the gap between the previously best-known bounds of $0.317$ and $0.736$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper proves that in the standard bilateral trade model with two agents having independent private values drawn from known distributions, any Bayesian incentive-compatible, individually rational, and strongly budget-balanced mechanism achieves expected gains from trade at least half those of the first-best (ex-post efficient) benchmark; the bound is tight.

Significance. If the result holds, it resolves a long-standing open question on the worst-case efficiency loss imposed by the Myerson-Satterthwaite constraints, replacing the previous interval [0.317, 0.736] with the tight constant 1/2. The result is stated for the canonical model and objective, with no free parameters or ad-hoc assumptions.

minor comments (2)
  1. [Abstract] Abstract: the statement that the result is 'tight' should be accompanied by a brief indication of the family of distributions (or the limiting case) that achieves equality, to allow immediate verification of the claim.
  2. The manuscript should include an explicit statement of the first-best and second-best objectives (expected gains from trade) and confirm that both are computed under the same prior, to avoid any ambiguity in the ratio SB/FB.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive report, accurate summary of our contribution, and recommendation of minor revision. No major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained proof

full rationale

The paper states a general mathematical proof that any BIC+IR+strongly budget-balanced mechanism in the canonical independent-values bilateral trade model achieves expected gains from trade at least 1/2 those of the ex-post efficient benchmark, with the bound tight. The abstract and description invoke only the standard Myerson-Satterthwaite impossibility (an external, long-established result) and the usual mechanism-design primitives; no parameter fitting, no self-definitional reduction of SB to FB, no load-bearing self-citation chain, and no ansatz or renaming of known empirical patterns. The central claim therefore does not reduce to its inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based on abstract only; the claim rests on the standard bilateral trade model with independent private values and the three constraints from Myerson-Satterthwaite. No free parameters, invented entities, or ad-hoc axioms are mentioned.

pith-pipeline@v0.9.1-grok · 5628 in / 1070 out tokens · 20029 ms · 2026-06-28T07:49:53.664053+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 11 canonical work pages

  1. [1]

    2025 , eprint=

    A Geometric Analysis of Gains from Trade , author=. 2025 , eprint=

    2025

  2. [2]

    2025 , url =

    Zhiyi Huang and Yiran Zhang , title =. 2025 , url =

    2025

  3. [3]

    Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms , pages =

    On Multi-Dimensional Gains from Trade Maximization , author =. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms , pages =. 2021 , doi =

    2021

  4. [4]

    2021 , eprint =

    A Note on the Gains from Trade of the Random-Offerer Mechanism , author =. 2021 , eprint =

    2021

  5. [5]

    A New Lower Bound for the Random Offerer Mechanism in Bilateral Trade using

    Yang Cai and Vineet Gupta and Zun Li and Aranyak Mehta , year =. A New Lower Bound for the Random Offerer Mechanism in Bilateral Trade using. 2603.08679 , archiveprefix=

    arXiv

  6. [6]

    doi:10.1016/0022-0531(83)90048-0 , author =

    Efficient mechanisms for bilateral trading , volume =. doi:10.1016/0022-0531(83)90048-0 , author =

    work page doi:10.1016/0022-0531(83)90048-0

  7. [7]

    International Conference on Web and Internet Economics , date =

    Liad Blumrosen and Yehonatan Mizrahi , title =. International Conference on Web and Internet Economics , date =. doi:10.1007/978-3-662-54110-4_28 , pages =

    work page doi:10.1007/978-3-662-54110-4_28

  8. [8]

    doi:10.1016/j.geb.2021.08.011 , pages =

    (Almost) efficient mechanisms for bilateral trading , author =. doi:10.1016/j.geb.2021.08.011 , pages =

    work page doi:10.1016/j.geb.2021.08.011 2021

  9. [9]

    Proceedings of the 2017 ACM Conference on Economics and Computation , date =

    Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms , author =. Proceedings of the 2017 ACM Conference on Economics and Computation , date =

    2017

  10. [10]

    Proceedings of the 55th Annual ACM Symposium on Theory of Computing , date =

    On the Optimal Fixed-Price Mechanism in Bilateral Trade , author =. Proceedings of the 55th Annual ACM Symposium on Theory of Computing , date =. doi:10.1145/3564246.3585171 , pages =

    work page doi:10.1145/3564246.3585171

  11. [11]

    doi:10.1145/3519935.3520054 , title =

    Yuan Deng and Jieming Mao and Balasubramanian Sivan and Kangning Wang , booktitle =. doi:10.1145/3519935.3520054 , title =

    work page doi:10.1145/3519935.3520054

  12. [12]

    doi:10.1145/3736252.3742519 , title =

    Yuan Deng and Jieming Mao and Balasubramanian Sivan and Kangning Wang and Jinzhao Wu , booktitle =. doi:10.1145/3736252.3742519 , title =

    work page doi:10.1145/3736252.3742519

  13. [13]

    doi:10.1007/978-3-031-22832-2_12 , title =

    Yumou Fei , booktitle =. doi:10.1007/978-3-031-22832-2_12 , title =

    work page doi:10.1007/978-3-031-22832-2_12

  14. [14]

    doi:10.1016/0022-0531(87)90104-9 , pages =

    Robust trading mechanisms , author =. doi:10.1016/0022-0531(87)90104-9 , pages =

    work page doi:10.1016/0022-0531(87)90104-9

  15. [15]

    Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms , date =

    Ilya Hajiaghayi and MohammadTaghi Hajiaghayi and Gary Peng and Suho Shin , title =. Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms , date =. doi:10.1137/1.9781611978322.164 , pages =

    work page doi:10.1137/1.9781611978322.164 2025

  16. [16]

    Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms , date =

    Zi Yang Kang and Francisco Pernice and Jan Vondr. Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms , date =. doi:10.1137/1.9781611977073.115 , pages =

    work page doi:10.1137/1.9781611977073.115 2022

  17. [17]

    doi:10.1145/3564246.3585160 , title =

    Zhengyang Liu and Zeyu Ren and Zihe Wang , booktitle =. doi:10.1145/3564246.3585160 , title =

    work page doi:10.1145/3564246.3585160

  18. [18]

    The Gains from Trade Under Fixed Price Mechanisms , author =

  19. [19]

    On general minimax theorems , author =

  20. [20]

    15.4.6 , howpublished =

    Gauss Hypergeometric Function: Special Cases, Eq. 15.4.6 , howpublished =