Tight Regret Bounds for Bilateral Trade under Semi Feedback
Not on the map. Why?
Abstract (arXiv)
The study of textitregret minimization in fixed-price bilateral trade has received considerable attention in recent research. Previous works [CCC+24a, CCC+24b, AFF24, BCCF24, CJLZ25, LCM25a, GDFS25] have acquired a thorough understanding of the problem, except for determining the tight regret bound for GBB semi-feedback fixed-price mechanisms under adversarial values. In this paper, we resolve this open question by devising an widetildeO(T2 / 3)-regret mechanism, matching the Omega(T2 / 3) lower bound from [CJLZ25] up to polylogarithmic factors.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 13 references that are in the map. First posted on arXiv 23 Jan 2026.
Builds on
6 of 13 references.
References · 6
- 2021Bilateral Trade: A Regret Minimization Perspectivecited by 29
- 2022An α-regret analysis of Adversarial Bilateral Tradecited by 16
- 2025Better Regret Rates in Bilateral Trade via Sublinear Budget Violationcited by 7
- 2025Nearly Tight Regret Bounds for Profit Maximization in Bilateral Tradecited by 7
- 2025Online Two-Sided Markets: Many Buyers Enhance Learningcited by 5
- 2025Tight Regret Bounds for Fixed-Price Bilateral Tradecited by 4
Built on by
Not cited yet.