Dynamic Assortment Selection and Pricing with Censored Preference Feedback
Jung-hun Kim, Min-hwan Oh
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b354f423-94ae-496b-b763-7b9796d7d23eBuilds on11
- Model-Based Reinforcement Learning with Value-Targeted RegressionAlex Ayoub, Zeyu Jia, Csaba Szepesvári, Mengdi Wang et al.ICML 2020 · 324 citations
- Improved Optimistic Algorithms for Logistic BanditsLouis Faury, Marc Abeille, Clément Calauzènes, Olivier FercoqICML 2020 · 127 citations
- Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function ApproximationXiaoyu Chen, Han Zhong, Zhuoran Yang, Zhaoran Wang et al.ICML 2022 · 90 citations
- Logarithmic Regret in Feature-based Dynamic PricingJianyu Xu, Yu-Xiang WangNeurIPS 2021 · 36 citations
- Online (Multinomial) Logistic Bandit: Improved Regret and Constant Computation CostYu-Jie Zhang, Masashi SugiyamaNeurIPS 2023 · 34 citations
Related papers
- Online Learning of Delayed ChoicesRecep Yusuf BekciNeurIPS 2024 · 1 citation
- Multinomial Logit Contextual Bandits: Provable Optimality and PracticalityMin-hwan Oh, Garud IyengarAAAI 2021 · 29 citations
- UCB-based Algorithms for Multinomial Logistic Regression BanditsSanae Amani, Christos ThrampoulidisNeurIPS 2021 · 18 citations
- Dynamic pricing and assortment under a contextual MNL demandNoémie Périvier, Vineet GoyalNeurIPS 2022 · 29 citations
- Improved Algorithms for Contextual Dynamic PricingMatilde Tullii, Solenne Gaucher, Nadav Merlis, Vianney PerchetNeurIPS 2024 · 18 citations
