跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要核心是库存优化和在线决策遗憾,未直接研究所列宏观预测或金融计量问题。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Lin An
Andrew A. Li
Benjamin Moseley
R. Ravi

有预测与无预测条件下的非平稳报童问题

研究问题
面对未知且非平稳的需求过程,如何在不知道非平稳程度、也不知道预测准确性的情况下,连续选择库存数量?
方法与思路
作者分别设计无预测策略及融合任意准确性预测的策略,推导遗憾界,并用三个包含大量时间序列的数据集验证。
材料陈述的贡献
摘要称,无预测策略达到阶最优遗憾;融合策略无需已知预测精度,实验约弥合两类单独策略间差距的百分之七十四。
阅读关注点
应核对非平稳程度和遗憾的定义、预测输入的形式、最优性比较范围,以及所报差距弥合比例的计算基准。
阅读边界
这是 arXiv 预印本,不能据此认定同行评审或期刊接收;摘要未给出遗憾界条件,所报比例也不能外推至其他需求环境。

原文摘要

The classic newsvendor model yields an optimal decision for a ``newsvendor'' selecting a quantity of inventory, under the assumption that the demand is drawn from a known distribution. Motivated by applications such as cloud provisioning and staffing, we consider a setting in which newsvendor-type decisions must be made sequentially, in the face of demand drawn from a stochastic process that is both unknown and nonstationary. All prior work on this problem either (a) assumes that the level of nonstationarity is known, or (b) imposes additional statistical assumptions that enable accurate predictions of the unknown demand. Our research tackles the Nonstationary Newsvendor without these assumptions, both with and without predictions. We first, in the setting without predictions, design a policy which we prove achieves order-optimal regret -- ours is the first policy to accomplish this without being given the level of nonstationarity of the underlying demand. We then, for the first time, introduce a model for generic (i.e. with no statistical assumptions) predictions with arbitrary accuracy, and propose a policy that incorporates these predictions without being given their accuracy. We upper bound the regret of this policy, and show that it matches the best achievable regret had the accuracy of the predictions been known. Our findings provide valuable insights on inventory management. Managers can make more informed and effective decisions in dynamic environments, reducing costs and enhancing service levels despite uncertain demand patterns. We empirically validate our new policy with experiments based on three real-world datasets containing thousands of time-series, showing that it succeeds in closing approximately 74% of the gap between the best approaches based on nonstationarity and predictions alone.

笔记与分组
相关领域论文