Amortized efficiency of list update and paging rules
Communications of the ACM
On the On-line Number of Snacks Problem
Journal of Global Optimization
On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Expected Value of Distribution Information for the Newsvendor Problem
Operations Research
On the on-line rent-or-buy problem in probabilistic environments
Journal of Global Optimization
Regret in the Newsvendor Model with Partial Information
Operations Research
The on-line rental problem with risk and probabilistic forecast
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Online algorithms for the newsvendor problem with and without censored demands
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Hi-index | 0.00 |
Recently, the single-period, single-item newsboy problem with limited distributional information (e.g., range, mean, mode, variance, symmetry) has been widely studied. However, the existing newsboy models with partial information are only fit to risk-neutral inventory managers. This paper considers the newsboy problem with range information. Based on the competitive ratio analysis, which guarantees a certain performance level under all possible input sequences, we construct a framework to manage risk and reward of newsboy problems under different forecasts (i.e. certain forecasts; probability forecasts; probability distributions). Comparing the existing studies, this approach helps the newsboy flexibly choose the optimal reward strategies, according to his own risk tolerance levels and different forecasts.