Reference health
Exploration Optimization for Dynamic Assortment Personalization under Linear Preferences
19/19 checkable references clean · checked 2026-10-16
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
14 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 19 checked references that resolve
resolves10.1111/poms.12402
Product Assortment and Price Competition under Multinomial Logit Demand
<sup/>
resolves10.1287/opre.1080.0640
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
resolves10.1287/mnsc.46.2.327.11931
Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis
resolves10.1287/opre.2017.1629
Technical Note—Dynamic Pricing and Demand Learning with Limited Price Experimentation
resolves10.1287/mnsc.2014.1904
A Demand Estimation Procedure for Retail Assortment Optimization with Results from Implementations
resolves10.1287/mnsc.1110.1426
Bayesian Dynamic Pricing Policies: Learning and Earning Under a Binary Prior Distribution
resolves10.1016/j.dam.2012.03.003
A branch-and-cut algorithm for the latent-class logit assortment problem
The 14 references without a DOI — listed, not checked
no DOI — not checkedImproved algorithms for linear stochastic bandits
no DOI — not checkedThompson sampling for contextual bandits with linear payoffs
no DOI — not checkedA dynamic clustering approach to data-driven assortment personalization
no DOI — not checkedref10
no DOI — not checkedA statistical learning approach to personalization in revenue management
no DOI — not checkedDynamic assortment optimization with changing contextual information
no DOI — not checkedThompson sampling for online personalized assortment optimization problems with multinomial logit choice models
no DOI — not checkedStochastic linear optimization under bandit feedback
no DOI — not checkedParametric bandits: The generalized linear case
no DOI — not checkedref23
no DOI — not checkedAssortment planning: Review of literature and industry practice
no DOI — not checkedref28
no DOI — not checkedProvably optimal algorithms for generalized linear contextual bandits
no DOI — not checkedref32
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-10-16 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.2139/ssrn.4115721"><img src="https://citestamp.com/citestamped/10.2139/ssrn.4115721/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.2139/ssrn.4115721)