Semi-Parametric Contextual Pricing Algorithm using Cox Proportional Hazards Model
- Authors
- Choi, Young-Geun; Kim, Gi-Soo; Choi, Yunseo; Cho, Wooseong; Paik, Myunghee Cho; Oh, Min-Hwan
- Issue Date
- Jul-2023
- Publisher
- ML Research Press
- Citation
- Proceedings of Machine Learning Research, v.202, pp 5771 - 5786
- Pages
- 16
- Journal Title
- Proceedings of Machine Learning Research
- Volume
- 202
- Start Page
- 5771
- End Page
- 5786
- URI
- https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/159455
- ISSN
- 2640-3498
2640-3498
- Abstract
- Contextual dynamic pricing is a problem of setting prices based on current contextual information and previous sales history to maximize revenue. A popular approach is to postulate a distribution of customer valuation as a function of contextual information and the baseline valuation. A semi-parametric setting, where the context effect is parametric and the baseline is nonparametric, is of growing interest due to its flexibility. A challenge is that customer valuation is almost never observable in practice and is instead type-I interval censored by the offered price. To address this challenge, we propose a novel semi-parametric contextual pricing algorithm for stochastic contexts, called the epoch-based Cox proportional hazards Contextual Pricing (CoxCP) algorithm. To our best knowledge, our work is the first to employ the Cox model for customer valuation. The CoxCP algorithm has a high-probability regret upper bound of Õ(T 2 3 d), where T is the length of horizon and d is the dimension of context. In addition, if the baseline is known, the regret bound can improve to O(d log T) under certain assumptions. We demonstrate empirically the proposed algorithm performs better than existing semi-parametric contextual pricing algorithms when the model assumptions of all algorithms are correct. © 2023 Proceedings of Machine Learning Research. All rights reserved.
- Files in This Item
-
Go to Link
- Appears in
Collections - ETC > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.