Dynamic Contextual Pricing with Doubly Non-Parametric Random Utility Models
Abstract: In the evolving landscape of digital commerce, adaptive dynamic pricing strategies are essential for gaining a competitive edge. This paper introduces novel {\em doubly nonparametric random utility models} that eschew traditional parametric assumptions used in estimating consumer demand's mean utility function and noise distribution. Existing nonparametric methods like multi-scale {\em Distributional Nearest Neighbors (DNN and TDNN)}, initially designed for offline regression, face challenges in dynamic online pricing due to design limitations, such as the indirect observability of utility-related variables and the absence of uniform convergence guarantees. We address these challenges with innovative population equations that facilitate nonparametric estimation within decision-making frameworks and establish new analytical results on the uniform convergence rates of DNN and TDNN, enhancing their applicability in dynamic environments. Our theoretical analysis confirms that the statistical learning rates for the mean utility function and noise distribution are minimax optimal. We also derive a regret bound that illustrates the critical interaction between model dimensionality and noise distribution smoothness, deepening our understanding of dynamic pricing under varied market conditions. These contributions offer substantial theoretical insights and practical tools for implementing effective, data-driven pricing strategies, advancing the theoretical framework of pricing models and providing robust methodologies for navigating the complexities of modern markets.
- Ban, G.-Y. and N. B. Keskin (2021). Personalized dynamic pricing with machine learning: High-dimensional features and heterogeneous elasticity. Management Science 67(9), 5549–5568.
- Meta dynamic pricing: Transfer learning across experiments. Management Science 68(3), 1865–1881.
- On the rate of convergence of the bagged nearest neighbor estimate. Journal of Machine Learning Research 11(2).
- Context-based dynamic pricing with separable demand models. Available at SSRN.
- Nonparametric learning algorithms for joint pricing and inventory control with lost sales and censored demand. Mathematics of Operations Research 46(2), 726–756.
- Nonparametric pricing analytics with customer covariates. Operations Research 69(3), 974–984.
- A primal–dual learning algorithm for personalized dynamic pricing with an inventory constraint. Mathematics of Operations Research 47(4), 2585–2613.
- Data-driven revenue management: The interplay of data, model, and decisions. Service Science.
- The Elements of Joint Learning and Optimization in Operations Management, Volume 18. Springer Nature.
- Privacy-preserving dynamic personalized pricing with demand learning. Management Science 68(7), 4878–4898.
- Feature-based dynamic pricing. Management Science 66(11), 4921–4943.
- Dynamic pricing with fairness constraints.
- Optimal nonparametric inference with two-scale distributional nearest neighbors. Journal of the American Statistical Association, 1–11.
- Den Boer, A. V. (2015). Dynamic pricing and learning: historical origins, current research, and new directions. Surveys in operations research and management science 20(1), 1–18.
- Policy optimization using semiparametric models for dynamic pricing. Journal of the American Statistical Association, 1–29.
- Principro: Data-driven algorithms for joint pricing and inventory control under price protection. Available at SSRN.
- Nonparametric stochastic contextual bandits. In Proceedings of the AAAI Conference on Artificial Intelligence, Volume 32.
- Smooth contextual bandits: Bridging the parametric and nondifferentiable regret regimes. Operations Research 70(6), 3261–3281.
- Dynamic pricing in high-dimensions. The Journal of Machine Learning Research 20(1), 315–363.
- Chasing demand: Learning and earning in a changing environment. Mathematics of Operations Research 42(2), 277–307.
- The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp. 594–605. IEEE.
- Bandit algorithms. Cambridge University Press.
- Dynamic pricing with external information and inventory constraint. Management Science 0(0).
- Distribution-free contextual dynamic pricing. Mathematics of Operations Research 49(1), 599–618.
- Reinforcement learning for fair dynamic pricing. In Proceedings of SAI Intelligent Systems Conference, pp. 120–135. Springer.
- Contextual pricing for lipschitz buyers. In Advances in Neural Information Processing Systems, Volume 31.
- Dynamic learning and pricing with model misspecification. Management Science 65(11), 4980–5000.
- The multi-armed bandit problem with covariates. The Annals of Statistics 41(2), 693–721.
- The effectiveness of field price discretion: Empirical evidence from auto lending. Management Science 61(8), 1741–1759.
- Dynamic pricing with demand covariates. arXiv preprint arXiv:1604.07463.
- Semi-parametric dynamic contextual pricing. In Advances in Neural Information Processing Systems, Volume 32.
- Slivkins, A. (2011). Contextual bandits with similarity information. In Proceedings of the 24th annual Conference On Learning Theory, pp. 679–702. JMLR Workshop and Conference Proceedings.
- Slivkins, A. et al. (2019). Introduction to multi-armed bandits. Foundations and Trends® in Machine Learning 12(1-2), 1–286.
- Steele, B. M. (2009). Exact bootstrap k-nearest neighbor learners. Machine Learning 74, 235–255.
- Stone, C. J. (1982). Optimal global rates of convergence for nonparametric regression. Ann. Statist. 10(4), 1040–1053.
- van den Boer, A. V. and N. B. Keskin (2022). Dynamic pricing with demand learning and reference effects. Management Science 68(10), 7112–7130.
- Online regularization toward always-valid high-dimensional dynamic pricing. Journal of the American Statistical Association, 1–13.
- Uncertainty quantification for demand prediction in contextual dynamic pricing. Production and Operations Management 30(6), 1703–1717.
- Xu, J. and Y.-X. Wang (2021). Logarithmic regret in feature-based dynamic pricing. Advances in Neural Information Processing Systems 34, 13898–13910.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.