High-Dimensional Dynamic Pricing Under Nonstationarity: Learning and Earning with Change-Point Detection

We consider a high-dimensional dynamic pricing problem under nonstationarity, in which a firm sells products to T sequentially arriving consumers that behave according to an unknown demand model with potential changes at unknown times. The demand model is assumed to be a high-dimensional generalized linear model (GLM), allowing for a feature vector in [Formula: see text] that encodes products and consumer information. To achieve optimal revenue (i.e., least regret), the firm needs to learn and exploit the unknown GLMs, monitoring for potential change points. To tackle such a problem, we first design a novel penalized likelihood-based online change-point detection algorithm for high-dimensional GLMs, and this is the first algorithm in the change-point literature that achieves optimal minimax localization error rate for high-dimensional GLMs. A change-point detection assisted dynamic pricing (CPDP) policy is further proposed and achieves a near-optimal regret of order [Formula: see text], where s is the sparsity level and [Formula: see text] is the number of change points. This regret is accompanied with a minimax lower bound, demonstrating the optimality of CPDP (up to logarithmic factors). In particular, the optimality with respect to [Formula: see text] is seen for the first time in the dynamic pricing literature and is achieved via a novel accelerated exploration mechanism. Extensive simulation experiments and a real data application on online lending illustrate the efficiency of the proposed policy and the importance and practical value of handling nonstationarity in dynamic pricing. This paper was accepted by Vivek Farias, data science. Funding: F. Jiang is supported in part by the National Natural Science Foundation of China [Grants 72522009, 12201124, 12331009, 72271060, and 72432002] and National Key Research and Development Program of China [Grant 2024YFA1015700]. Y. Yu is supported by Engineering and Physical Sciences Research Council [Grant EP/Z531327/1] and the Leverhulme Trust. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2023.00889 .

Authors

Institutions

Publication Details

Journal
Management Science
Published
2026-05-18
DOI
https://doi.org/10.1287/mnsc.2023.00889
Primary Topic
Advanced Bandit Algorithms Research
Type
preprint
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

High-Dimensional Dynamic Pricing Under Nonstationarity: Learning and Earning with Change-Point Detection

Yi Yu, Feiyu Jiang, Xi Chen, Zifeng Zhao
Management Science
Advanced Bandit Algorithms Research
preprint

High-Dimensional Dynamic Pricing Under Nonstationarity: Learning and Earning with Change-Point Detection

Yi Yu, Feiyu Jiang, Xi Chen, Zifeng Zhao
preprint en

Abstract

We consider a high-dimensional dynamic pricing problem under nonstationarity, in which a firm sells products to T sequentially arriving consumers that behave according to an unknown demand model with potential changes at unknown times. The demand model is assumed to be a high-dimensional generalized linear model (GLM), allowing for a feature vector in [Formula: see text] that encodes products and consumer information. To achieve optimal revenue (i.e., least regret), the firm needs to learn and exploit the unknown GLMs, monitoring for potential change points. To tackle such a problem, we first design a novel penalized likelihood-based online change-point detection algorithm for high-dimensional GLMs, and this is the first algorithm in the change-point literature that achieves optimal minimax localization error rate for high-dimensional GLMs. A change-point detection assisted dynamic pricing (CPDP) policy is further proposed and achieves a near-optimal regret of order [Formula: see text], where s is the sparsity level and [Formula: see text] is the number of change points. This regret is accompanied with a minimax lower bound, demonstrating the optimality of CPDP (up to logarithmic factors). In particular, the optimality with respect to [Formula: see text] is seen for the first time in the dynamic pricing literature and is achieved via a novel accelerated exploration mechanism. Extensive simulation experiments and a real data application on online lending illustrate the efficiency of the proposed policy and the importance and practical value of handling nonstationarity in dynamic pricing. This paper was accepted by Vivek Farias, data science. Funding: F. Jiang is supported in part by the National Natural Science Foundation of China [Grants 72522009, 12201124, 12331009, 72271060, and 72432002] and National Key Research and Development Program of China [Grant 2024YFA1015700]. Y. Yu is supported by Engineering and Physical Sciences Research Council [Grant EP/Z531327/1] and the Leverhulme Trust. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2023.00889 .

Management Science
University of Notre Dame (US), Fudan University (CN), University of Warwick (GB), New York University (US)
Openalex Percentile: Top 100%
Advanced Bandit Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.