Incentive-aware Contextual Pricing with Non-parametric Market Noise

We consider a dynamic pricing problem for repeated contextual second-price auctions with strategic buyers whose goals are to maximize their long-term time discounted utility. The seller has very limited information about buyers' overall demand curves, which depends on $d$-dimensional context vectors characterizing auctioned items, and a non-parametric market noise distribution that captures buyers' idiosyncratic tastes. The noise distribution and the relationship between the context vectors and buyers' demand curves are both unknown to the seller. We focus on designing the seller's learning policy to set contextual reserve prices where the seller's goal is to minimize his regret for revenue. We first propose a pricing policy when buyers are truthful and show that it achieves a $T$-period regret bound of $\tilde{\mathcal{O}}(\sqrt{dT})$ against a clairvoyant policy that has full information of the buyers' demand. Next, under the setting where buyers bid strategically to maximize their long-term discounted utility, we develop a variant of our first policy that is robust to strategic (corrupted) bids. This policy incorporates randomized "isolation" periods, during which a buyer is randomly chosen to solely participate in the auction. We show that this design allows the seller to control the number of periods in which buyers significantly corrupt their bids. Because of this nice property, our robust policy enjoys a $T$-period regret of $\tilde{\mathcal{O}}(\sqrt{dT})$, matching that under the truthful setting up to a constant factor that depends on the utility discount factor.

[1]  J. Kiefer,et al.  Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator , 1956 .

[2]  J. Kiefer,et al.  Asymptotic Minimax Character of the Sample Distribution Function for Vector Chance Variables , 1959 .

[3]  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..

[4]  D. Fudenberg,et al.  Behavior-Based Price Discrimination and Customer Recognition , 2007 .

[5]  Benjamin Edelman,et al.  Strategic bidder behavior in sponsored search auctions , 2007, Decis. Support Syst..

[6]  Kunal Talwar,et al.  Mechanism Design via Differential Privacy , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[7]  R. Esteves,et al.  A Survey on the Economics of Behaviour-Based Price Discrimination , 2009 .

[8]  Omar Besbes,et al.  Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms , 2009, Oper. Res..

[9]  Buy-It-Now or Take-a-Chance: Price Discrimination through Randomized Auctions , 2011 .

[10]  S. Bikhchandani,et al.  Behavior - Based Price Discrimination by a Patient Seller , 2011 .

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

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

[13]  Christos Koufogiannakis,et al.  A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs , 2013, Algorithmica.

[14]  L. Elisa Celis,et al.  Buy-It-Now or Take-a-Chance: Price Discrimination through Randomized Auctions , 2011, Manag. Sci..

[15]  Umar Syed,et al.  Repeated Contextual Auctions with Strategic Buyers , 2014, NIPS.

[16]  Joel A. Tropp,et al.  An Introduction to Matrix Concentration Inequalities , 2015, Found. Trends Mach. Learn..

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

[18]  Mohsen Bayati,et al.  Online Decision-Making with High-Dimensional Covariates , 2015 .

[19]  Tim Roughgarden,et al.  Ironing in the Dark , 2015, EC.

[20]  Mehryar Mohri,et al.  Learning Algorithms for Second-Price Auctions with Reserve , 2016, J. Mach. Learn. Res..

[21]  Tim Roughgarden,et al.  Minimizing Regret with Multiple Reserves , 2016, EC.

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

[23]  Adel Javanmard Perishability of Data: Dynamic Pricing under Varying-Coefficient Models , 2017, J. Mach. Learn. Res..

[24]  V. Mirrokni,et al.  Boosted Second Price Auctions: Revenue Optimization for Heterogeneous Bidders , 2017 .

[25]  G. Gallego,et al.  Nonparametric Learning and Optimization with Covariates , 2018, ArXiv.

[26]  Jinyan Liu,et al.  Learning Optimal Reserve Price against Non-myopic Bidders , 2018, NeurIPS.

[27]  Vahab S. Mirrokni,et al.  Incentive-Aware Learning for Large Markets , 2018, WWW.

[28]  Renato Paes Leme,et al.  Auction Design for ROI-Constrained Buyers , 2018, WWW.

[29]  Renato Paes Leme,et al.  Contextual Search via Intrinsic Volumes , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[30]  Adel Javanmard,et al.  Dynamic Pricing in High-Dimensions , 2016, J. Mach. Learn. Res..

[31]  Virag Shah,et al.  Semi-parametric dynamic contextual pricing , 2019, NeurIPS.

[32]  Adel Javanmard,et al.  Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions , 2018, NeurIPS.

[33]  Renato Paes Leme,et al.  LP-based Approximation for Personalized Reserve Prices , 2019, EC.

[34]  Vahab Mirrokni,et al.  Robust Pricing in Non-Clairvoyant Dynamic Mechanism Design , 2019 .

[35]  Adam Schultz,et al.  Dynamic Learning and Market Making in Spread Betting Markets with Informed Bettors , 2019, EC.

[36]  Mohsen Bayati,et al.  Online Decision Making with High-Dimensional Covariates , 2020, Oper. Res..

[37]  Haifeng Xu,et al.  The Intrinsic Robustness of Stochastic Bandits to Strategic Manipulation , 2019, ICML.

[38]  Hamid Nazerzadeh,et al.  Dynamic Reserve Prices for Repeated Auctions: Learning from Bids , 2014, ArXiv.