• Corpus ID: 245650925

# Online Regularization towards Always-Valid High-Dimensional Dynamic Pricing

@inproceedings{Wang2020OnlineRT,
title={Online Regularization towards Always-Valid High-Dimensional Dynamic Pricing},
author={ChiHua Wang and Zhanyu Wang and Will Wei Sun and Guang Cheng},
year={2020}
}
• Published 5 July 2020
• Computer Science
Devising dynamic pricing policy with always valid online statistical learning procedure is an important and as yet unresolved problem. Most existing dynamic pricing policy, which focus on the faithfulness of adopted customer choice models, exhibit a limited capability for adapting the online uncertainty of learned statistical model during pricing process. In this paper, we propose a novel approach for designing dynamic pricing policy based regularized online statistical learning with…

## References

SHOWING 1-10 OF 70 REFERENCES
Policy Optimization Using Semiparametric Models for Dynamic Pricing
• Computer Science
SSRN Electronic Journal
• 2021
A dynamic statistical learning and decision-making policy is proposed that combines semiparametric estimation from a generalized linear model with an unknown link and online decision making to minimize regret (maximize revenue) and generalize to the case when the product features are dynamically dependent.
Uncertainty Quantification for Demand Prediction in Contextual Dynamic Pricing
• Computer Science
SSRN Electronic Journal
• 2020
This paper develops a debiased approach to demand function prediction and provides the asymptotic normality guarantee of thedebiased estimator, which provides both point-wise and uniform confidence intervals of the demand function.
Statistical Inference for Online Decision Making via Stochastic Gradient Descent
• Computer Science
ArXiv
• 2020
Focusing on the statistical inference of online decision making, the asymptotic normality of the parameter estimator produced by the algorithm and the online inverse probability weighted value estimator used to estimate the optimal value are established.
Distribution-free Contextual Dynamic Pricing
• Computer Science
ArXiv
• 2021
This paper establishes the regret upper bound and a matching lower bound of the policy in the perturbed linear bandit framework and proves a sub-linear regret bound in the considered pricing problem.
Meta Dynamic Pricing: Transfer Learning Across Experiments
• Computer Science
SSRN Electronic Journal
• 2019
A meta dynamic pricing algorithm that learns a prior online while solving a sequence of Thompson sampling pricing experiments for N different products, demonstrating that the price of an unknown prior in Thompson sampling can be negligible in experiment-rich environments.
A Statistical Learning Approach to Personalization in Revenue Management
• Computer Science
• 2015
We consider a logit model-based framework for modeling joint pricing and assortment decisions that take into account customer features. This model provides a significant advantage when one has
Personalized Dynamic Pricing with Machine Learning: High Dimensional Features and Heterogeneous Elasticity
• Computer Science
• 2020
This work 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 “semi-clairvoyant” seller that achieves an expected regret of order s √Tlog T.
Low-rank Bandit Methods for High-dimensional Dynamic Pricing
• Computer Science
NeurIPS
• 2019
This work designs dynamic pricing algorithms whose revenue approaches that of the best fixed price vector in hindsight, at a rate that only depends on the intrinsic rank of the demand model and not the number of products.
Dynamic Learning and Pricing with Model Misspecification
• Economics
• 2018
We study a multiperiod dynamic pricing problem with contextual information, where the seller uses a misspecified demand model. The seller sequentially observes past demand, updates model parameters,
Semi-parametric dynamic contextual pricing
• Computer Science
NeurIPS
• 2019
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.