The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Open accessAbstract
Companies such as Zara and World Co. have recently implemented novel product development processes and supply chain architectures enabling them to make more product design and assortment decisions during the selling season, when actual demand information becomes available. How should such retail firms modify their product assortment over time in order to maximize overall profits for a given selling season? Focusing on a stylized version of this problem, we study a finite horizon multiarmed bandit model with several plays per stage and Bayesian learning. Our analysis involves the Lagrangian relaxation of weakly coupled dynamic programs (DPs), results contributing to the emerging theory of DP duality, and various approximations. It yields a closed-form dynamic index policy capturing the key exploration versus exploitation trade-off and associated suboptimality bounds. In numerical experiments its performance proves comparable to that of other closed-form heuristics described in the literature, but this policy is particularly easy to implement and interpret. This last feature enables extensions to more realistic versions of the motivating dynamic assortment problem that include implementation delays, switching costs, and demand substitution effects.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
(1995) · Cited by 10,558
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
Lagarias, J. C., Reeds, J. A., Wright, M. H., & Wright, P. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496303470 · Cited by 7,447
Ross, S. M. (1982) · Cited by 3,812
Optimal Statistical Decisions.
Siegmund, D., & DeGroot, M. H. (1972) · Journal of the American Statistical Association · doi:10.2307/2284675 · Cited by 3,386
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Bandit processes and dynamic allocation indices
Gittins, J. C. (1979) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1979.tb01068.x · Cited by 1,487
Ben-Akiva (1985) · Medical Entomology and Zoology · Cited by 1,371
Restless bandits: activity allocation in a changing world
Whittle, P. (1988) · Journal of Applied Probability · doi:10.1017/s0021900200040420 · Cited by 1,173
Randolph, P. H. (1970) · Technometrics · doi:10.1080/00401706.1970.10488715 · Cited by 986
Cited by
Perspectives in supply chain risk management
Tang, C. S. (2006) · International Journal of Production Economics · doi:10.1016/j.ijpe.2005.12.006 · Cited by 2,577
Introduction to Multi-Armed Bandits
Slivkins, A. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000068 · Cited by 780
Assortment Planning: Review of Literature and Industry Practice
Kök, A. G., Fisher, M. L., & Vaidyanathan, R. (2008) · International Series in Operations Research & Management Science · doi:10.1007/978-0-387-78902-6_6 · Cited by 413
Dynamic Pricing for Nonperishable Products with Demand Learning
Araman, V. F., & Caldentey, R. (2009) · Operations Research · doi:10.1287/opre.1090.0725 · Cited by 282
(2009) · Cited by 21
Metadata
- Authors
- Caro, F., & Gallien, J.
- Venue
- Management Science
- Published
- 2007-02
- Volume
- 53
- Issue
- 2
- Pages
- 276-292
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2124832196
- Cited by
- 306
- References
- 31
- FWCI
- 16.00
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic Assortment with Demand Learning for Seasonal Consumer Goods. https://app.cochat.ai/papers/10.1287/mnsc.1060.0613
- The paper
- Caro, F., & Gallien, J. (2007). Dynamic Assortment with Demand Learning for Seasonal Consumer Goods. Management Science. https://doi.org/10.1287/mnsc.1060.0613
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.