Amortized efficiency of list update and paging rules
Communications of the ACM
Nearly optimal competitive online replacement policies
Mathematics of Operations Research
Online computation and competitive analysis
Online computation and competitive analysis
Theoretical Computer Science
Nearly optimal strategies for special cases of on-line capital investment
Theoretical Computer Science
On the on-line rent-or-buy problem in probabilistic environments
Journal of Global Optimization
Semi-online algorithms for scheduling with machine cost
Journal of Computer Science and Technology
New results on online replacement problem
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A risk-reward competitive analysis of the bahncard problem
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
| Hi-index | 0.00 |
When a new investment opportunity of purchasing a new device occurs, the investors must decide whether or not and when to buy this device in an online fashion. That is, the online player must make an investment decision while neither future demand for orders nor future investment opportunities are known. This problem which generalizes the basic leasing problem has been introduced by Azar et al., and then two special cases have been studied by Damaschke. In the so-called equal prices model a 2-competitive algorithm is devised and a 1.618 lower bound is given. Here we make use of an averaging technique and obtain a better tight lower bound of 2, in other words, this lower bound cannot be improved. Furthermore, another special case which only considers two-stage device replacement is studied in this paper. Accounting for the interest rate is an essential feature of any reasonable financial model. Therefore, we explore the two-stage model with and without the interest rate respectively. In addition, we introduce the risk-reward model to analyze this problem and improve the competitive ratio performance.