Dynamic Assortment Selection and Pricing with Censored Preference Feedback

Jung-hun Kim, Min-hwan Oh
2/12/2026

No official code found. Best implementation: junghunkim7786/DynamicAssortmentSelectionPricing (0 stars, last commit 2025-03-28).

Abstract

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

View on arXivView PDF

Code Implementations(1)

00PythonFeb 23, 20251 years ago

Similar Papers

Cite this paper

@article{kim2026dynamic,
  title  = {Dynamic Assortment Selection and Pricing with Censored Preference Feedback},
  author = {Jung-hun Kim and Min-hwan Oh},
  year   = {2026},
  eprint = {2504.02324},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2504.02324},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.02324.svg)](https://codeofpaper.com/paper/2504.02324)

Discussion