Pith. sign in

REVIEW 1 cited by

Dynamic Assortment Selection and Pricing with Censored Preference Feedback

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.02324 v1 pith:F6OAXUZE submitted 2025-04-03 stat.ML cs.LG

classification stat.MLcs.LG
keywords pricingproductselectionachieveboundcensoredconfidencedynamic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Two-Timescale Hierarchical Reinforcement Learning for Resilient Operations

    stat.ML 2026-07 conditional novelty 6.0 of 10

    Synchronized two-timescale hierarchical PPO-style learning converges in average optimality gap at O(T^{-1/2}) (faster under market sharpness) and raises simulated used-car profits under joint shocks.

Pith tools