Bilateral Trade: A Regret Minimization Perspective

Bilateral trade, a fundamental topic in economics, models the problem of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. In this paper, we cast the bilateral trade problem in a regret minimization framework over ) rounds of seller/buyer interactions, with no prior knowledge on their private valuations. Our main contribution is a complete characterization of the regret regimes for fixed-price mechanisms with different feedback models and private valuations, using as a benchmark the best fixed-price in hindsight. More precisely, we prove the following tight bounds on the regret: • Θ (√ ) ) for full-feedback (i.e., direct revelation mechanisms). • Θ ( ) 2/3 ) for realistic feedback (i.e., posted-price mechanisms) and independent seller/buyer valuations with bounded densities. • Θ() ) for realistic feedback and seller/buyer valuations with bounded densities. • Θ() ) for realistic feedback and independent seller/buyer valuations. • Θ() ) for the adversarial setting.

[1]  Yi Li,et al.  Improved bounds on the sample complexity of learning , 2000, SODA '00.

[2]  Stefano Leonardi,et al.  A Regret Analysis of Bilateral Trade , 2021, EC.

[3]  M. Naaman On the tight constant in the multivariate Dvoretzky–Kiefer–Wolfowitz inequality , 2021 .

[4]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[5]  Avrim Blum,et al.  Near-optimal online auctions , 2005, SODA '05.

[6]  Éva Tardos,et al.  Learning and Efficiency in Games with Dynamic Population , 2015, SODA.

[7]  Nikhil R. Devanur,et al.  Bandits with concave rewards and convex knapsacks , 2014, EC.

[8]  Josef Broder,et al.  Dynamic Pricing Under a General Parametric Choice Model , 2012, Oper. Res..

[9]  Csaba Szepesvári,et al.  Partial Monitoring - Classification, Regret Bounds, and Algorithms , 2014, Math. Oper. Res..

[10]  Csaba Szepesvari,et al.  Bandit Algorithms , 2020 .

[11]  Nicolò Cesa-Bianchi,et al.  Regret Minimization Under Partial Monitoring , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[12]  Jean-Yves Audibert,et al.  Minimax Policies for Adversarial and Stochastic Bandits. , 2009, COLT 2009.

[13]  W. Rogerson,et al.  Robust trading mechanisms , 1987 .

[14]  Xueqing Sun,et al.  On dynamic pricing under model uncertainty , 2022, Naval Research Logistics (NRL).

[15]  Thomas M. Cover,et al.  Behavior of sequential predictors of binary sequences , 1965 .

[16]  Constantinos Daskalakis,et al.  Learning in Auctions: Regret is Hard, Envy is Easy , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[17]  Yang Cai,et al.  Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms , 2017, EC.

[18]  Claudio Gentile,et al.  Ieee Transactions on Information Theory 1 Regret Minimization for Reserve Prices in Second-price Auctions , 2022 .

[19]  Moshe Babaioff,et al.  Dynamic Pricing with Limited Supply , 2011, ACM Trans. Economics and Comput..

[20]  Shahar Dobzinski,et al.  (Almost) Efficient Mechanisms for Bilateral Trading , 2016, ArXiv.

[21]  Yuval Peres,et al.  Perfect Bayesian Equilibria in Repeated Sales , 2014, SODA.

[22]  Bart de Keijzer,et al.  Approximately Efficient Double Auctions with Strong Budget Balance , 2016, SODA.

[23]  Shahar Dobzinski,et al.  Reallocation mechanisms , 2014, EC.

[24]  Paul W. Goldberg,et al.  Fixed Price Approximability of the Optimal Gain from Trade , 2017, WINE.

[25]  Vijay Kumar,et al.  Online learning in online auctions , 2003, SODA '03.

[26]  Alexey Drutsa,et al.  Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer , 2018, ICML.

[27]  Renato Paes Leme,et al.  Feature-based Dynamic Pricing , 2016, EC.

[28]  Umar Syed,et al.  Learning Prices for Repeated Auctions with Strategic Buyers , 2013, NIPS.

[29]  Peter L. Bartlett,et al.  Neural Network Learning - Theoretical Foundations , 1999 .

[30]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[31]  A. V. den Boer,et al.  Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions , 2013 .

[32]  M. Satterthwaite,et al.  Efficient Mechanisms for Bilateral Trading , 1983 .

[33]  Nikhil R. Devanur,et al.  Online Auctions and Multi-scale Online Learning , 2017, EC.

[34]  Frank Thomson Leighton,et al.  The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[35]  N. Bora Keskin,et al.  Discontinuous Demand Functions: Estimation and Pricing , 2017 .

[36]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[37]  Mehryar Mohri,et al.  Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers , 2014, NIPS.

[38]  Vianney Perchet,et al.  Dynamic Pricing with Finitely Many Unknown Valuations , 2018, ALT.

[39]  Paul Dütting,et al.  Efficient Two-Sided Markets with Limited Information , 2020, ArXiv.

[40]  Aleksandrs Slivkins,et al.  Bandits with Knapsacks , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[41]  Aleksandrs Slivkins,et al.  Introduction to Multi-Armed Bandits , 2019, Found. Trends Mach. Learn..

[42]  P. Massart The Tight Constant in the Dvoretzky-Kiefer-Wolfowitz Inequality , 1990 .