Fixed-Price Approximations in Bilateral Trade
Not on the map. Why?
Abstract (arXiv)
We consider the bilateral trade problem, in which two agents trade a single indivisible item. It is known that the only dominant-strategy truthful mechanism is the fixed-price mechanism: given commonly known distributions of the buyer's value B and the seller's value S, a price p is offered to both agents and trade occurs if S ≤ p ≤ B. The objective is to maximize either expected welfare mathbbE[S + (B-S) 1S ≤ p ≤ B] or expected gains from trade mathbbE[(B-S) 1S ≤ p ≤ B]. We improve the approximation ratios for several welfare maximization variants of this problem. When the agents' distributions are identical, we show that the optimal approximation ratio for welfare is frac2+√24. With just one prior sample from the common distribution, we show that a 3/4-approximation to welfare is achievable. When agents' distributions are not required to be identical, we show that a previously best-known (1-1/e)-approximation can be strictly improved, but 1-1/e is optimal if only the seller's distribution is known.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Jul 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 3; 2025: 2; 2026: 3.
10 papers.
- 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
- 2024Learning to Maximize Gains From Trade in Small Marketscited by 5
- 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
- 2024Learning to Maximize Gains From Trade in Small Markets21 Jan 2024
- 2023No-Regret Learning in Bilateral Trade via Global Budget Balance18 Oct 2023
- 2023An Online Learning Theory of Brokerage18 Oct 2023