mlsanityData to 14 Oct 2026

Dynamic Assortment Selection and Pricing with Censored Preference Feedback

arXiv 2504.02324 ↗First posted 3 Apr 2025stat.ML cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

In this study, we investigate the problem of dynamic multi-product selection and pricing by introducing a novel framework based on a textitcensored 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 tildeO(d^frac32√T/kappa) and tildeO(d2√T/kappa), respectively. Finally, we validate the performance of our methods through simulations, demonstrating their effectiveness.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 15 of its 31 references that are in the map. First posted on arXiv 3 Apr 2025.

Builds on

15 of 31 references.

References · 15

  1. 2020Model-Based Reinforcement Learning with Value-Targeted Regressioncited by 234
  2. 2020Improved Optimistic Algorithms for Logistic Banditscited by 118
  3. 2022Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximationcited by 81
  4. 2020Instance-Wise Minimax-Optimal Algorithms for Logistic Banditscited by 57
  5. 2016Dynamic Pricing in High-dimensionscited by 55
  6. 2017MNL-Bandit: A Dynamic Learning Approach to Assortment Selectioncited by 50
  7. 2017Thompson Sampling for the MNL-Banditcited by 35
  8. 2021Policy Optimization Using Semi-parametric Models for Dynamic Pricingcited by 23
  9. 2021Logarithmic Regret in Feature-based Dynamic Pricingcited by 22
  10. 2021Multinomial Logit Contextual Bandits: Provable Optimality and Practicalitycited by 21
  11. 2021Dynamic pricing and assortment under a contextual MNL demandcited by 20
  12. 2024Nearly Minimax Optimal Regret for Multinomial Logistic Banditcited by 20
3 more
  1. 2019Semi-parametric dynamic contextual pricingcited by 17
  2. 2019Multi-Product Dynamic Pricing in High-Dimensions with Heterogeneous Price Sensitivitycited by 12
  3. 2024Queueing Matching Bandits with Preference Feedbackcited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.