Dynamic Assortment Selection and Pricing with Censored Preference Feedback

In this study, we investigate the problem of dynamic multi-product selection and pricing by introducing a novel framework based on a $\mathit{\text{censored}}\mathit{\text{multinomial}}\mathit{\text{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 $\tilde{O}(d^{\frac{3}{2}}\sqrt{T\mathrm{/}\kappa })$ and $\tilde{O}(d^2\sqrt{T\mathrm{/}\kappa })$, respectively. Finally, we validate the performance of our methods through simulations, demonstrating their effectiveness.