Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms
Not on the map. Why?
Abstract (arXiv)
We design simple mechanisms to approximate the Gains from Trade (GFT) in two-sided markets with multiple unit-supply sellers and multiple unit-demand buyers. A classical impossibility result by Myerson and Satterthwaite showed that even with only one seller and one buyer, no Individually Rational (IR), Bayesian Incentive Compatible (BIC) and Budget-Balanced (BB) mechanism can achieve full GFT (trade whenever buyer's value is higher than the seller's cost). On the other hand, they proposed the "second-best" mechanism that maximizes the GFT subject to IR, BIC and BB constraints, which is unfortunately rather complex for even the single-seller single-buyer case. Our mechanism is simple, IR, BIC and BB, and achieves frac12 of the optimal GFT among all IR, BIC and BB mechanisms. Our result holds for arbitrary distributions of the buyers' and sellers' values and can accommodate any downward-closed feasibility constraints over the allocations. The analysis of our mechanism is facilitated by extending the Cai-Weinberg-Devanur duality framework to two-sided markets.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Jun 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 2; 2024: 2; 2025: 2; 2026: 3.
11 papers.
- 2021Bilateral Trade: A Regret Minimization Perspectivecited by 29
- 2021A Regret Analysis of Bilateral Tradecited by 19
- 2023No-Regret Learning in Bilateral Trade via Global Budget Balancecited by 17
- 2023An Online Learning Theory of Brokeragecited by 8
- 2025Nearly Tight Regret Bounds for Profit Maximization in Bilateral Tradecited by 7
- 2024A Parametric Contextual Online Learning Theory of Brokeragecited by 4
- 2025A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokeragecited by 2
- 2026Nonparametric Contextual Online Bilateral Tradecited by 2
- 2026A New Lower Bound for the Random Offerer Mechanism in Bilateral Trade using AI-Guided Evolutionary Searchcited by 1
- 2024Trading Volume Maximization with Online Learningcited by 0
- 2026Regret Minimization in Bilateral Trade With Perturbed Marketscited by 0
- 2026Regret Minimization in Bilateral Trade With Perturbed Markets11 May 2026
- 2026A New Lower Bound for the Random Offerer Mechanism in Bilateral Trade using AI-Guided Evolutionary Search9 Mar 2026
- 2026Nonparametric Contextual Online Bilateral Trade13 Feb 2026
- 2025Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade26 Sep 2025
- 2025A Tight Regret Analysis of Non-Parametric Repeated Contextual Brokerage3 Mar 2025
- 2024A Parametric Contextual Online Learning Theory of Brokerage22 May 2024
- 2024Trading Volume Maximization with Online Learning21 May 2024
- 2023No-Regret Learning in Bilateral Trade via Global Budget Balance18 Oct 2023
- 2023An Online Learning Theory of Brokerage18 Oct 2023
- 2021Bilateral Trade: A Regret Minimization Perspective8 Sep 2021
- 2021A Regret Analysis of Bilateral Trade16 Feb 2021