On the on-line rent-or-buy problem in probabilistic environments

Fujiwara and Iwama [In: The 13th Annual International Symposium on Algorithms and Computation, pp. 476–488 (2002)] first integrated probability distribution into the classical competitive analysis to study the rental problem. They assumed that the future inputs are drawn from an exponential distribution, and obtained the optimal competitive strategy and the competitive ratio by the derivative method. In this paper, we introduce the interest rate and tax rate into the continuous model of Fujiwra and Iwama [In: The 13th Annual International Symposium on Algorithms and Computation, pp. 476–488 (2002)]. Moreover, we use the forward difference method in different probabilistic environments to consider discrete leasing models both with and without the interest rate. We not only give the optimal competitive strategies and their competitive ratios in theory, but also give numerical results. We find that with the introduction of the interest rate and tax rate, the uncertainty involved in the process of decision making will diminish and the optimal purchasing date will be put off.

[1]  Peter Damaschke.  Nearly optimal strategies for special cases of on-line capital investment , 2003, Theor. Comput. Sci..

[2]  Anna R. Karlin,et al.  Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.

[3]  Yin-Feng Xu,et al.  On-line k-Truck Problem and Its Competitive Algorithms , 2001, J. Glob. Optim..

[4]  Gerhard J. Woeginger,et al.  Optimal on-line algorithms for variable-sized bin covering , 1999, Oper. Res. Lett..

[5]  Prabhakar Raghavan,et al.  A Statistical Adversary for On-line Algorithms , 1991, On-Line Algorithms.

[6]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[7]  Kazuo Iwama,et al.  Using Generalized Forecasts for Online Currency Conversion , 1999, COCOON.

[8]  Kazuo Iwama,et al.  Average-Case Competitive Analyses for Ski-Rental Problems , 2002, ISAAC.

[9]  James Nga-Kwok Liu,et al.  On the On-line Number of Snacks Problem , 2002, J. Glob. Optim..

[10]  Ran El-Yaniv,et al.  Nearly Optimal Competitive Online Replacement Policies , 1997, Math. Oper. Res..

[11]  Ran El-Yaniv,et al.  Competitive Optimal On-Line Leasing , 1999, Algorithmica.

[12]  Allan Borodin,et al.  On the power of randomization in on-line algorithms , 2005, Algorithmica.

[13]  Immanuel M. Bomze,et al.  Evolution towards the Maximum Clique , 1997, J. Glob. Optim..

[14]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[15]  L Wei.  BAYESIAN PROCEDURE IN TIME SEQUENTIAL SAMPLE PLAN OF GEOMETRIC DISTRIBUTION , 1999 .

[16]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[17]  Merton H. Miller,et al.  LEASING, BUYING, AND THE COST OF CAPITAL SERVICES , 1976 .

[18]  Sabah al-Binali,et al.  A Risk‐Reward Framework for the Competitive Analysis of Financial Games , 1999, Algorithmica.

[19]  Susanne Albers,et al.  Delayed Information and Action in On-Line Algorithms , 2001, Inf. Comput..

[20]  Richard M. Karp,et al.  On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? , 1992, IFIP Congress.

[21]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[22]  Lawrence D. Schall.  The Lease-or-Buy and Asset Acquisition Decisions , 1974 .

[23]  Amos Fiat,et al.  On Capital Investment , 1999, Algorithmica.