Reference health
Fast Algorithms for Online Personalized Assortment Optimization in a Big Data Regime
36/36 checkable references clean · checked 2026-08-28
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.
34 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 36 checked references that resolve
resolves10.1016/S0022-0000(03)00025-4
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
resolves10.1287/mnsc.2020.3680
Personalized Dynamic Pricing with Machine Learning: High-Dimensional Features and Heterogeneous Elasticity
resolves10.1561/2200000024
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
resolves10.1287/mnsc.1060.0661
Category Management and Coordination in Retail Assortment Planning in the Presence of Basket Shopping Consumers
resolves10.1287/mnsc.2020.3772
A Statistical Learning Approach to Personalization in Revenue Management
resolves10.1287/opre.2021.2158
Customer Choice Models vs. Machine Learning: Finding Optimal Product Displays on Alibaba
resolves10.1287/mnsc.1060.0580
Assortment Planning and Inventory Decisions Under a Locational Choice Model
resolves10.1145/2783258.2783364
Improved Bounds on the Dot Product under Random Projection and Random Sign Projection
resolves10.1287/opre.2015.1355
The<i>d</i>-Level Nested Logit Model: Assortment and Price Optimization Problems
resolves10.1145/1772690.1772758
A contextual-bandit approach to personalized news article recommendation
resolves10.1145/1935826.1935878
Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms
resolves10.1111/j.1467-8640.2012.00427.x
A WEB‐BASED PERSONALIZED BUSINESS PARTNER RECOMMENDATION SYSTEM USING FUZZY SEMANTIC TECHNIQUES
resolves10.1287/opre.1100.0866
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
resolves10.1287/mnsc.45.11.1496
On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments
resolves10.1145/2764468.2764488
Estimating the Causal Impact of Recommendation Systems from Observational Data
resolves10.1016/j.ins.2013.01.025
A hybrid fuzzy-based personalized recommender system for telecom products/services
The 34 references without a DOI — listed, not checked
no DOI — not checkedImproved algorithms for linear stochastic bandits
no DOI — not checkedOnline-to-confidence-set conversions and application to sparse stochastic bandits
no DOI — not checkedThompson sampling for the mnl-bandit
no DOI — not checkedThompson sampling for contextual bandits with linear payoffs
no DOI — not checkedUsing confidence bounds for exploitation-exploration trade-offs
no DOI — not checkedA dynamic clustering approach to data-driven assortment personalization
no DOI — not checkedref15
no DOI — not checkedBandit theory meets compressed sensing for high dimensional stochastic linear bandit
no DOI — not checkedAn empirical evaluation of Thompson sampling
no DOI — not checkedref21
no DOI — not checkedref22
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 checkedContextual bandits with linear payoff functions
no DOI — not checkedStochastic linear optimization under bandit feedback
no DOI — not checkedref29
no DOI — not checkedref31
no DOI — not checkedThe netflix recommender system: Algorithms, business value, and innovation
no DOI — not checkedref38
no DOI — not checkedref40
no DOI — not checkedScalable generalized linear bandits: Online computation and hashing
no DOI — not checkedAssortment planning: Review of literature and industry practice
no DOI — not checkedProvably optimal algorithms for generalized linear contextual bandits
no DOI — not checkedThompson sampling for multinomial logit contextual bandits
no DOI — not checkedref53
no DOI — not checkedref54
no DOI — not checkedref56
no DOI — not checkedref60
no DOI — not checkedPractical bayesian optimization of machine learning algorithms
no DOI — not checkedLearning from logged implicit exploration data
no DOI — not checkedRegression shrinkage and selection via the lasso
no DOI — not checkedOnline assortment optimization with high-dimensional data
no DOI — not checkedNear-optimal policies for dynamic multinomial logit assortment selection models
no DOI — not checkedref70
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-08-28 — 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.3432574"><img src="https://citestamp.com/citestamped/10.2139/ssrn.3432574/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.2139/ssrn.3432574)