An α-regret analysis of Adversarial Bilateral Trade
Not on the map. Why?
Abstract (arXiv)
We study sequential bilateral trade where sellers and buyers valuations are completely arbitrary (i.e., determined by an adversary). Sellers and buyers are strategic agents with private valuations for the good and the goal is to design a mechanism that maximizes efficiency (or gain from trade) while being incentive compatible, individually rational and budget balanced. In this paper we consider gain from trade which is harder to approximate than social welfare. We consider a variety of feedback scenarios and distinguish the cases where the mechanism posts one price and when it can post different prices for buyer and seller. We show several surprising results about the separation between the different scenarios. In particular we show that (a) it is impossible to achieve sublinear α-regret for any α<2, (b) but with full feedback sublinear 2-regret is achievable (c) with a single price and partial feedback one cannot get sublinear α regret for any constant α (d) nevertheless, posting two prices even with one-bit feedback achieves sublinear 2-regret, and (e) there is a provable separation in the 2-regret bounds between full and partial feedback.
Key facts. Cited by 16 papers in the map (data through 13 Oct 2026). Builds on 22 of its 55 references that are in the map. First posted on arXiv 13 Oct 2022.
Builds on
22 of 55 references.
References · 22
- 2019Introduction to Online Convex Optimizationcited by 798
- 2019Introduction to Multi-Armed Banditscited by 479
- 2018Adversarial Bandits with Knapsackscited by 73
- 2014Nonstochastic Multi-Armed Bandits with Graph-Structured Feedbackcited by 61
- 2014Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problemscited by 46
- 2021Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimizationcited by 40
- 2015Online learning in repeated auctionscited by 39
- 2021Bilateral Trade: A Regret Minimization Perspectivecited by 29
- 2015Learning in Auctions: Regret is Hard, Envy is Easycited by 23
- 2021A Regret Analysis of Bilateral Tradecited by 19
- 2018Cleaning up the neighborhood: A full classification for adversarial partial monitoringcited by 16
- 2020Efficient Two-Sided Markets with Limited Informationcited by 14
10 more
- 2021Beyond Bandit Feedback in Online Multiclass Classificationcited by 14
- 2017Efficient Online Linear Optimization with Approximation Algorithmscited by 12
- 2022Learning on the Edge: Online Learning with Stochastic Feedback Graphscited by 12
- 2015Learning and Efficiency in Games with Dynamic Populationcited by 9
- 2021Approximately Efficient Bilateral Tradecited by 9
- 2016(Almost) Efficient Mechanisms for Bilateral Tradingcited by 8
- 2017Fixed Price Approximability of the Optimal Gain From Tradecited by 8
- 2014Reallocation Mechanismscited by 6
- 2020Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Boundscited by 4
- 2020The Complexity of Interactively Learning a Stable Matching by Trial and Errorcited by 3
Built on by
Citing papers per year: 2023: 4; 2024: 3; 2025: 2; 2026: 7.
16 papers.
Sort:
- 2023No-Regret Learning in Bilateral Trade via Global Budget Balancecited by 17
- 2023Repeated Bilateral Trade Against a Smoothed Adversarycited by 15
- 2025Nearly Tight Regret Bounds for Profit Maximization in Bilateral Tradecited by 7
- 2024Selling Joint Ads: A Regret Minimization Perspectivecited by 5
- 2024Fair Online Bilateral Tradecited by 4
- 2024Market Making without Regretcited by 4
- 2025Tight Regret Bounds for Fixed-Price Bilateral Tradecited by 4
- 2026Contextual Online Bilateral Tradecited by 3
- 2026The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanismscited by 2
- 2026Nonparametric Contextual Online Bilateral Tradecited by 2
- 2026Profit Maximization in Bilateral Trade against a Smooth Adversarycited by 1
- 2023Tight Bounds for γ-Regret via the Decision-Estimation Coefficientcited by 0
4 more
- 2023α-Fair Contextual Banditscited by 0
- 2026Tight Regret Bounds for Bilateral Trade under Semi Feedbackcited by 0
- 2026Regret Minimization in Bilateral Trade With Perturbed Marketscited by 0
- 2026Breaking the T3/4 Barrier for Regret Minimization With Bi-Dimensional CDFscited by 0
- 2026Breaking the T3/4 Barrier for Regret Minimization With Bi-Dimensional CDFs22 Jul 2026
- 2026Profit Maximization in Bilateral Trade against a Smooth Adversary12 May 2026
- 2026Regret Minimization in Bilateral Trade With Perturbed Markets11 May 2026
- 2026Nonparametric Contextual Online Bilateral Trade13 Feb 2026
- 2026Contextual Online Bilateral Trade13 Feb 2026
- 2026The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms11 Feb 2026
- 2026Tight Regret Bounds for Bilateral Trade under Semi Feedback23 Jan 2026
- 2025Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade26 Sep 2025
- 2025Tight Regret Bounds for Fixed-Price Bilateral Trade6 Apr 2025
- 2024Market Making without Regret21 Nov 2024
- 2024Selling Joint Ads: A Regret Minimization Perspective12 Sep 2024
- 2024Fair Online Bilateral Trade22 May 2024
4 more
- 2023α-Fair Contextual Bandits22 Oct 2023
- 2023No-Regret Learning in Bilateral Trade via Global Budget Balance18 Oct 2023
- 2023Tight Bounds for γ-Regret via the Decision-Estimation Coefficient6 Mar 2023
- 2023Repeated Bilateral Trade Against a Smoothed Adversary21 Feb 2023
- 2023No-Regret Learning in Bilateral Trade via Global Budget Balancecited by 17
- 2023Repeated Bilateral Trade Against a Smoothed Adversarycited by 15
- 2025Nearly Tight Regret Bounds for Profit Maximization in Bilateral Tradecited by 7
- 2024Selling Joint Ads: A Regret Minimization Perspectivecited by 5
- 2024Fair Online Bilateral Tradecited by 4
- 2024Market Making without Regretcited by 4
- 2025Tight Regret Bounds for Fixed-Price Bilateral Tradecited by 4
- 2026Contextual Online Bilateral Tradecited by 3
- 2026The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanismscited by 2
- 2026Nonparametric Contextual Online Bilateral Tradecited by 2
- 2026Profit Maximization in Bilateral Trade against a Smooth Adversarycited by 1
- 2023Tight Bounds for γ-Regret via the Decision-Estimation Coefficientcited by 0
12 most cited of 16 All 16 (JSON)
- 2026Breaking the T3/4 Barrier for Regret Minimization With Bi-Dimensional CDFs22 Jul 2026
- 2026Profit Maximization in Bilateral Trade against a Smooth Adversary12 May 2026
- 2026Regret Minimization in Bilateral Trade With Perturbed Markets11 May 2026
- 2026Nonparametric Contextual Online Bilateral Trade13 Feb 2026
- 2026Contextual Online Bilateral Trade13 Feb 2026
- 2026The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms11 Feb 2026
- 2026Tight Regret Bounds for Bilateral Trade under Semi Feedback23 Jan 2026
- 2025Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade26 Sep 2025
- 2025Tight Regret Bounds for Fixed-Price Bilateral Trade6 Apr 2025
- 2024Market Making without Regret21 Nov 2024
- 2024Selling Joint Ads: A Regret Minimization Perspective12 Sep 2024
- 2024Fair Online Bilateral Trade22 May 2024
12 newest of 16 All 16 (JSON)