Jianqing Fan, Yongyi Guo, Mengxin Yu
arXiv 13 Sep 2021 · Machine Learning
arXiv:2109.06368 · PDF · DOI · OpenAlex · Extracted main text
In this paper, we study the contextual dynamic pricing problem where the market value of a product is linear in its observed features plus some market noise. Products are sold one at a time, and only a binary response indicating success or failure of a sale is observed. Our model setting is similar to Javanmard and Nazerzadeh [2019] except that we expand the demand curve to a semiparametric model and need to learn dynamically both parametric and nonparametric components. We propose a dynamic statistical learning and decision-making policy that combines semiparametric estimation from a generalized linear model with an unknown link and online decision-making to minimize regret (maximize revenue). Under mild conditions, we show that for a market noise c.d.f. $F(\cdot)$ with $m$-th order derivative ($m\geq 2$), our policy achieves a regret upper bound of $\tilde{O}_{d}(T^{\frac{2m+1}{4m-1}})$, where $T$ is time horizon and $\tilde{O}_{d}$ is the order that hides logarithmic terms and the dimensionality of feature $d$. The upper bound is further reduced to $\tilde{O}_{d}(\sqrt{T})$ if $F$ is super smooth whose Fourier transform decays exponentially. In terms of dependence on the horizon $T$, these upper bounds are close to $\Omega(\sqrt{T})$, the lower bound where $F$ belongs to a parametric class. We further generalize these results to the case with dynamically dependent product features under the strong mixing condition.
appendix boundary found by appendix_command · 43% of the source is main text. Read the extracted text to check this.
The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.
| Reference | Intensity | Mentions | Sections | Main text | |
|---|---|---|---|---|---|
| 1 | Javanmard, A. and Nazerzadeh, H (2019) Dynamic pricing in high-dimensions | 1.000 | 13 | 6 | 100% |
| 2 | Carroll, R. J., Fan, J., Gijbels, I. and Wand, M. P (1997) Generalized partially linear single-index models self | 0.928 | 4 | 3 | 100% |
| 3 | Ban, G. and Keskin, N (2020) Personalized dynamic pricing with machine learning: High dimensional features and heterogeneous elasticity | 0.874 | 8 | 2 | 100% |
| 4 | Golrezaei, N., Javanmard, A. and Mirrokni, V (2020) Dynamic incentive-aware learning: Robust pricing in contextual auctions | 0.874 | 7 | 2 | 100% |
| 5 | Luo, Y., Sun, W. W. and Liu, Y (2021) Distribution-free contextual dynamic pricing | 0.874 | 7 | 2 | 100% |
| 6 | Tsybakov, A. B (2008) Introduction to Nonparametric Estimation | 0.843 | 3 | 3 | 100% |
| 7 | Shah, V., Johari, R. and Blanchet, J (2019) Semi-parametric dynamic contextual pricing | 0.811 | 4 | 2 | 100% |
| 8 | Wang, C.-H., Wang, Z., Sun, W. W. and Cheng, G (2020) Online regularization for high-dimensional dynamic pricing algorithms | 0.811 | 4 | 2 | 100% |
| 9 | Fan, J. and Gijbels, I (1996) Local polynomial modelling and its applications self | 0.811 | 4 | 2 | 100% |
| 10 | Broder, J. and Rusmevichientong, P (2012) Dynamic pricing under a general parametric choice model | 0.737 | 3 | 2 | 100% |
Showing the top 10 of 86 scored citations.