Corpus ID: 237513897

Distribution-free Contextual Dynamic Pricing

  title={Distribution-free Contextual Dynamic Pricing},
  author={Yiyun Luo and Will Wei Sun and Yufeng Liu},
  • Yiyun Luo, W. Sun, Yufeng Liu
  • Published 15 September 2021
  • Mathematics, Computer Science
  • ArXiv
Contextual dynamic pricing aims to set personalized prices based on sequential interactions with customers. At each time period, a customer who is interested in purchasing a product comes to the platform. The customer’s valuation for the product is a linear function of contexts, including product and customer features, plus some random market noise. The seller does not observe the customer’s true valuation, but instead needs to learn the valuation by leveraging contextual information and… Expand

Figures from this paper


Semi-parametric dynamic contextual pricing
A semi- Parametric model in which the residual distribution is non-parametric and the first algorithm which learns both regression parameters and residual distribution with $\tilde O(\sqrt{n})$ regret is developed. Expand
Personalized Dynamic Pricing with Machine Learning: High Dimensional Features and Heterogeneous Elasticity
We consider a seller who can dynamically adjust the price of a product at the individual customer level, by utilizing information about customers’ characteristics encoded as a d-dimensional featureExpand
Personalized Dynamic Pricing with Machine Learning: High-Dimensional Features and Heterogeneous Elasticity
This paper considers a seller who can dynamically adjust the price of a product at the individual customer level, by utilizing information about customers’ characteristics encoded as a d-dimensional feature vector, and designs a near-optimal pricing policy for a semiclairvoyant seller who achieves an expected regret of order. Expand
Multimodal Dynamic Pricing
Through rigorous regret analysis, this paper demonstrates that the proposed algorithm achieves optimal worst-case regret over a wide range of smooth function classes, and shows that in special cases, such as strongly concave or infinitely smooth reward functions, the algorithm achieves an optimal regret, matching optimal regret established in previous works. Expand
Multi-Product Dynamic Pricing in High-Dimensions with Heterogeneous Price Sensitivity
A pricing policy is proposed, named M3P, that achieves a T-period regret of O(log(Td)($\sqrt T $ +d log(T))) under heterogeneous price sensitivity for products with features of dimension d and it is proved that no policy can achieve worst-case T-regret better than Ω ($\sqRT T $). Expand
Dynamic Pricing and Demand Learning with Limited Price Experimentation
In a dynamic pricing problem where the demand function is not known a priori, price experimentation can be used as a demand learning tool. Existing literature usually assumes no constraint on priceExpand
Nonparametric Pricing Analytics with Customer Covariates
It is proved that no policy can achieve a regret less than $O(T^{(2+d)/(4+d)})$ for a particular instance and thus demonstrate the near optimality of the proposed policy. Expand
Perishability of Data: Dynamic Pricing under Varying-Coefficient Models
This work proposes a pricing policy based on projected stochastic gradient descent (PSGD) and characterize its regret in terms of time $T, features dimension $d, and the temporal variability in the model parameters, $\delta_t$. Expand
Dynamic Learning and Pricing with Model Misspecification
We study a multi-period dynamic pricing problem with contextual information where the seller uses a misspecified demand model. The seller sequentially observes past demand, updates model parameters,Expand
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions
This work proposes two learning policies that are robust to strategic behavior in repeated contextual second-price auctions and uses the outcomes of the auctions, rather than the submitted bids, to estimate the preferences while controlling the long-term effect of the outcome of each auction on the future reserve prices. Expand