Dynamic Assortment Selection and Pricing with Censored Preference Feedback
Jung-hun Kim, Min-hwan Oh
摘要
In this study, we investigate the problem of dynamic multi-product selection and pricing by introducing a novel framework based on a censored multinomial logit (C-MNL) choice model. In this model, sellers present a set of products with prices, and buyers filter out products priced above their valuation, purchasing at most one product from the remaining options based on their preferences. The goal is to maximize seller revenue by dynamically adjusting product offerings and prices, while learning both product valuations and buyer preferences through purchase feedback. To achieve this, we propose a Lower Confidence Bound (LCB) pricing strategy. By combining this pricing strategy with either an Upper Confidence Bound (UCB) or Thompson Sampling (TS) product selection approach, our algorithms achieve regret bounds of O(d 3 2 T /κ) and O(d 2 T /κ), respectively. Finally, we validate the performance of our methods through simulations, demonstrating their effectiveness.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper11
- Model-Based Reinforcement Learning with Value-Targeted RegressionAlex Ayoub, Zeyu Jia, Csaba Szepesvári, Mengdi Wang 等ICML 2020 · 被引用 324 次
- Improved Optimistic Algorithms for Logistic BanditsLouis Faury, Marc Abeille, Clément Calauzènes, Olivier FercoqICML 2020 · 被引用 127 次
- Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function ApproximationXiaoyu Chen, Han Zhong, Zhuoran Yang, Zhaoran Wang 等ICML 2022 · 被引用 90 次
- Logarithmic Regret in Feature-based Dynamic PricingJianyu Xu, Yu-Xiang WangNeurIPS 2021 · 被引用 36 次
- Online (Multinomial) Logistic Bandit: Improved Regret and Constant Computation CostYu-Jie Zhang, Masashi SugiyamaNeurIPS 2023 · 被引用 34 次
相关 Paper
- Online Learning of Delayed ChoicesRecep Yusuf BekciNeurIPS 2024 · 被引用 1 次
- Multinomial Logit Contextual Bandits: Provable Optimality and PracticalityMin-hwan Oh, Garud IyengarAAAI 2021 · 被引用 29 次
- UCB-based Algorithms for Multinomial Logistic Regression BanditsSanae Amani, Christos ThrampoulidisNeurIPS 2021 · 被引用 18 次
- Dynamic pricing and assortment under a contextual MNL demandNoémie Périvier, Vineet GoyalNeurIPS 2022 · 被引用 29 次
- Improved Algorithms for Contextual Dynamic PricingMatilde Tullii, Solenne Gaucher, Nadav Merlis, Vianney PerchetNeurIPS 2024 · 被引用 18 次
