Competitive analysis of the online financial lease problem

The financial lease is an important financing tool by which the lessee can acquire ownership of equipment upon the expiration of the lease after making a series of rent payments for the use of the equipment. In this paper, we consider an online version of this financial lease decision problem in which the decision maker (the lessee) does not know how long he/she will use the equipment. By assuming, the lessee can use the equipment through two options: financial lease or lease; we define and solve this online financial lease decision problem using the competitive analysis method. The optimal online strategies are discussed in each financial lease case with or without down payment. Finally, the optimal strategies are summarized as simple decision rules.

[1]  Ran El-Yaniv,et al.  Competitive solutions for online financial problems , 1998, CSUR.

[2]  Yin-Feng Xu,et al.  Competitive strategies for an online generalized assignment problem with a service consecution constraint , 2013, Eur. J. Oper. Res..

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

[4]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..

[5]  Boaz Patt-Shamir,et al.  Ski rental with two general options , 2008, Inf. Process. Lett..

[6]  Rudolf Fleischer On the Bahncard problem , 2001, Theor. Comput. Sci..

[7]  Boaz Patt-Shamir,et al.  Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental , 2012, SIAM J. Discret. Math..

[8]  Yin-Feng Xu,et al.  An optimal online algorithm for single machine scheduling with bounded delivery times , 2010, Eur. J. Oper. Res..

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

[10]  Zizhuo Wang,et al.  A dynamic learning algorithm for online matching problems with concave returns , 2015, Eur. J. Oper. Res..

[11]  Kim S. Larsen,et al.  Competitive analysis of the online inventory problem , 2010, Eur. J. Oper. Res..

[12]  Yin-Feng Xu,et al.  The ski-rental problem with multiple discount options , 2011, Inf. Process. Lett..

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

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