Journal article · 2026 · Open access
The Data-Driven Censored Newsvendor Problem
Management Science · Published 13 November 2026 · DOI 10.1287/mnsc.2024.09021
In brief
“The Data-Driven Censored Newsvendor Problem” is a 2026 journal article by Chamsi Hssaine and Sean R. Sinclair, published in Management Science. OpenAlex counts 15 citations as of 18 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 15
- Most cited in
- 2026 (12)
- Field-weighted impact
- 25.33
- References
- 66
- Authors
- 2
Abstract
We study a censored variant of the data-driven newsvendor problem, where the decision maker must select an ordering quantity that minimizes expected overage and underage costs based only on offline censored sales data rather than historical demand realizations. Our goal is to understand how the degree of historical demand censoring affects the performance of any learning algorithm for this problem. To isolate this impact, we adopt a distributionally robust optimization framework, evaluating policies according to their worst-case regret over an ambiguity set of distributions. This set is defined by the largest historical order quantity (the observable boundary of the data set), and contains all distributions matching the true demand distribution up to this boundary while allowing them to be arbitrary afterward. We demonstrate a spectrum of achievability under demand censoring by deriving a natural necessary and sufficient condition under which vanishing regret is an achievable goal. In regimes in which it is not, we exactly characterize the information loss due to censoring: an insurmountable lower bound on the performance of any policy, even when the decision maker has access to infinitely many demand samples. We then leverage these sharp characterizations to propose a natural robust algorithm that adapts to the historical level of demand censoring. We derive finite-sample guarantees for this algorithm across all possible censoring regimes and show its near-optimality with matching lower bounds (up to polylogarithmic factors). We moreover demonstrate its robust performance via extensive numerical experiments on both synthetic and real-world data sets. This paper was accepted by Wolfram Wiesemann, data science. Supplemental Material: The online appendices and data files are available at https://doi.org/10.1287/mnsc.2024.09021 .
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Hssaine, C., & Sinclair, S. R. (2026). The Data-Driven Censored Newsvendor Problem. Management Science. https://doi.org/10.1287/mnsc.2024.09021
MLA 9
Hssaine, Chamsi, and Sean R. Sinclair. “The Data-Driven Censored Newsvendor Problem.” Management Science, 2026. https://doi.org/10.1287/mnsc.2024.09021.
Chicago
Hssaine, Chamsi and Sean R. Sinclair. 2026. “The Data-Driven Censored Newsvendor Problem.” Management Science. https://doi.org/10.1287/mnsc.2024.09021.
Harvard
Hssaine, C. and Sinclair, S. R. (2026) ‘The Data-Driven Censored Newsvendor Problem’, Management Science. doi:10.1287/mnsc.2024.09021.
IEEE
C. Hssaine and S. R. Sinclair, “The Data-Driven Censored Newsvendor Problem,” Management Science, 2026, doi: 10.1287/mnsc.2024.09021.
BibTeX
@article{hssaine2026data,
title = {{The Data-Driven Censored Newsvendor Problem}},
author = {Hssaine, Chamsi and Sinclair, Sean R.},
journal = {Management Science},
year = {2026},
doi = {10.1287/mnsc.2024.09021},
url = {https://doi.org/10.1287/mnsc.2024.09021}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 1 | |
| 2025 | 2 | |
| 2026 | 12 |
Its field-weighted citation impact is 25.33: it has been cited 25.33 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Supply Chain and Inventory Management
- distributionally robust optimization
- worst-case regret
- ambiguity set
- lower bounds
- finite-sample guarantees
- robust learning algorithm
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Hssaine, C., & Sinclair, S. R. (2026). The Data-Driven Censored Newsvendor Problem. Management Science. https://doi.org/10.1287/mnsc.2024.09021
How many times has this paper been cited?
15 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Chamsi Hssaine, Sean R. Sinclair.
What is the DOI of this paper?
10.1287/mnsc.2024.09021, permanently at https://doi.org/10.1287/mnsc.2024.09021. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.