Amortized efficiency of list update and paging rules
Communications of the ACM
Nearly optimal competitive online replacement policies
Mathematics of Operations Research
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
Average-Case Competitive Analyses for Ski-Rental Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the on-line rent-or-buy problem in probabilistic environments
Journal of Global Optimization
A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Hi-index | 0.00 |
This paper proposes a generalized on-line risk-reward model, by introducing the notion of the probabilistic forecast. Using this model, we investigate the on-line rental problem. We design the risk rental algorithms under the basic probability forecast and the geometric distribution probability forecast, respectively. In contrast to the existing competitive analyses of the on-line rental problem, our results are more flexible and can help the investor choosing the optimal algorithm according to his/her own risk tolerance level and probabilistic forecast. Moreover, we also show that this model has a good linkage to the stochastic competitive ratio analysis.