The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand
Abstract
We study stochastic inventory planning with lost sales and instantaneous replenishment where, contrary to the classical inventory theory, knowledge of the demand distribution is not available. Furthermore, we observe only the sales quantity in each period and lost sales are unobservable, that is, demand data are censored. The manager must make an ordering decision in each period based only on historical sales data. Excess inventory is either perishable or carried over to the next period. In this setting, we propose nonparametric adaptive policies that generate ordering decisions over time. We show that the T-period average expected cost of our policy differs from the benchmark newsvendor cost—the minimum expected cost that would have incurred if the manager had known the underlying demand distribution—by at most O(1/T 0.5).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Cited by
The Big Data Newsvendor: Practical Insights from Machine Learning
Ban, G.-Y., & Rudin, C. (2019) · Operations Research · doi:10.1287/opre.2018.1757 · Cited by 507
Non-stationary stochastic optimization
Besbes, O., Gur, Y., & Zeevi, A. (2015) · Operations Research · doi:10.1287/opre.2015.1408 · Cited by 337
The Data-Driven Newsvendor Problem: New Bounds and Insights
Levi, R., Perakis, G., & Uichanco, J. (2015) · Operations Research · doi:10.1287/opre.2015.1422 · Cited by 256
Metadata
- Authors
- Huh, W. T., & Rusmevichientong, P.
- Venue
- Mathematics of Operations Research
- Published
- 2009-02
- Volume
- 34
- Issue
- 1
- Pages
- 103-123
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2160172818
- Cited by
- 219
- References
- 1
- FWCI
- 11.29
- Type
- journal article
- Language
- en
- Open access
- closed
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: A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand. https://app.cochat.ai/papers/10.1287/moor.1080.0355
- The paper
- Huh, W. T., & Rusmevichientong, P. (2009). A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand. Mathematics of Operations Research. https://doi.org/10.1287/moor.1080.0355
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.