Research Article | Open Access
Xingyu Yang, Weiguo Zhang, Weijun Xu, Yong Zhang, "Competitive Analysis for Online Leasing Problem with Compound Interest Rate", Abstract and Applied Analysis, vol. 2011, Article ID 156254, 12 pages, 2011. https://doi.org/10.1155/2011/156254
Competitive Analysis for Online Leasing Problem with Compound Interest Rate
We introduce the compound interest rate into the continuous version of the online leasing problem and discuss the generalized model by competitive analysis. On the one hand, the optimal deterministic strategy and its competitive ratio are obtained; on the other hand, a nearly optimal randomized strategy is constructed and a lower bound for the randomized competitive ratios is proved by Yao's principle. With the help of numerical examples, the theoretical results show that the interest rate puts off the purchase date and diminishes the uncertainty involved in the decision making.
In this paper, we consider the continuous version of the online leasing problem in a market with compound interest rate. In this problem, an online player needs some equipment (e.g., a computer, a car) for an initially unknown amount of time. To use the equipment, he may choose from the following two options: to lease it for a leasing fee per unit of time (the leasing option) or to buy it for a larger amount (the buying option). Once the player has bought the equipment, he no longer has to pay leasing fees. For each moment that he has not bought the equipment and still needs it, he must decide whether to go on leasing or to buy. The player's goal is to minimize his total cost, including leasing fees and perhaps one purchase fee. The issue of the problem is to determine when to switch from the leasing option to the buying one without the future information.
Online leasing problem is one of the fundamental problems in financial decision making and has been widely concerned using the theory of competitive analysis. In the context of competitive analysis, an online algorithm, which has no knowledge of the future events, is measured by the ratio of its performance to the performance of an optimal offline algorithm, which has full knowledge of the future events. Competitive analysis was explicitly formulated by Sleator and Tarjan  and then has been extensively used to evaluate and design online algorithms for many online optimization problems arising in computer systems [2–5]. Since financial transactions are often carried out without knowing the future events, it can be said that the nature of most financial problems is inherently online. Therefore, it is natural to extend competitive analysis to study financial games , such as portfolio selections , replacement problems , Bahncard problem , and one-way trading .
Now, we illustrate the theory of competitive analysis using the cost minimization problem. Let denote the set of all the inputs for the problem and an online algorithm. For a given input , denote by and the costs incurred by and an optimal offline algorithm, respectively. Online algorithm is called (strictly) -competitive if, for each input , Thus, a -competitive algorithm guarantees that its cost is not more than times the cost incurred by an optimal offline algorithm on each input. The smallest such that is -competitive is called ’s competitive ratio, denoted by . The smaller the competitive ratio, the better the algorithm. The smallest one is called the optimal competitive ratio, and an algorithm achieving the optimal competitive ratio is called an optimal competitive algorithm.
From the definitions above, we have that It can be seen that an online algorithm is adjudged good only if it performs well compared with an optimal offline algorithm on each input. Therefore, competitive ratio is a worst case performance measure. It is sometimes convenient to view an online problem as a two-person zero-sum game. The first player is the online player, whose payoff is defined as the reciprocal of the competitive ratio for the online algorithm he adopts, and the adversary is the optimal offline player, whose payoff is defined as the respective (additive) inverse of the online player's payoff . In this game, the online player adopts some online algorithm and makes it known to the adversary, and then the adversary chooses an input so as to make the competitive ratio as large as possible. The online player's objective is to minimize the competitive ratio. In the above analysis, the adversary knows the online player's exact action before the game begins. Therefore, it is often criticized as the adversary possesses too much power, while the online player has too little power. Randomization is often used to offer the online player significantly more power and improve his performance. A randomized online algorithm can be defined as a probability distribution on the set consisted of all deterministic algorithms. Various adversary models have been defined in the context of randomized algorithms, and in this paper we only concern the model of the oblivious adversary, which is the most usual. For other types of adversary such as adaptive online adversary and adaptive offline adversary, we refer the readers to . An oblivious adversary knows the probability distribution of the randomized algorithm but does not know which action the online player will adopt exactly, and he must predetermine the input before the game begins and pays for it optimally. That is, he is oblivious to the random choices made by the online player. The competitive ratio for randomized algorithm with respect to an oblivious adversary is defined the same as (1.1) with replaced by , which is the expected value of 's cost on input .
The online leasing problem has been investigated by many authors [13–15]. For the continuous version, the optimal deterministic and randomized competitive ratios are 2 and , respectively [2, 3]. When considering alternative financial decisions, an agent must consider their net present value. That is, accounting for the market interest rate is an essential feature of any reasonable financial model. El-Yaniv et al.  introduced the market interest rate into the discrete model and obtained the optimal deterministic and randomized competitive ratios. However, there are no results on the continuous version of the online leasing problem with interest rate. Naturally, we introduce the compound interest rate into the continuous version of the leasing problem. In this paper, we pursuit optimal deterministic and randomized strategies for the generalized model.
The rest of this paper is arranged as follows. In Section 2, we prove the optimal deterministic strategy and its competitive ratio. In Section 3, we construct a nearly optimal randomized strategy. In Section 4, we obtain a lower bound for the randomized competitive ratios. In Section 5, we analyze the results thanks to numerical examples. Section 6 concludes this paper.
2. Deterministic Strategy
In this section, we introduce the compound interest rate in the market into the traditional online leasing problem of continuous version and discuss its optimal deterministic strategy and optimal competitive ratio.
Let be the compound interest rate in the market. Then, the future value of the starting principal at time is . Alternatively, the net present value of units of money transferred at time is . Remind that denotes the leasing fee per unit of time and the purchase fee. Set . Suppose that the online player continuously uses the equipment for some time and then never uses it again. Without loss of generality, we assume that the cost of purchasing initially is less than the cost of leasing forever; that is, Otherwise, the player can attain a competitive ratio of 1 just by taking the strategy of leasing all the time. From (2.1), we obtain that .
The net present value of leasing for units of time is The net present value of leasing for units of time followed by a purchase is
From , we obtain for all , which indicates that the offline player will never take the strategy of purchasing the equipment after leasing it for some time. Therefore, the offline player either buys the equipment in the beginning or leases all the time until he never uses it again.
Suppose that is the root of the following equation: then
When , the offline player will lease all the time, incurring a cost of . Otherwise, he will buy in the beginning, incurring a cost of . Therefore, the cost of the optimal offline strategy is The online player has no knowledge of . Denote by the strategy that the online player will lease for units of time and then buy. The cost of the online strategy is
Based on competitive analysis, we can obtain the optimal deterministic strategy and its competitive ratio.
Theorem 2.1. For the online leasing problem in a market with compound interest rate , the optimal deterministic strategy is : if , then always lease; otherwise, lease for units of time and then buy, where is defined in (2.6). Moreover, the optimal deterministic competitive ratio is .
Proof. We prove the theorem by worst-case analysis. The worst case for the problem is that the offline player ends the game immediately when the online player buys the equipment. That is, the input is slightly larger than . We split the analysis into two cases: and .
Case 1. . In this case, the worst input belongs to . Hence, the optimal offline strategy will always lease and thus the offline cost is , while the online strategy will lease first and then buy at time , incurring a cost of . Thus, in this case, the competitive ratio for is Case 2. . In this case, the worst input belongs to . Hence, the optimal offline player will buy the equipment in the beginning and thus the offline cost is , while online strategy will still lease first and then buy at time , incurring the same cost of . Thus, in this case, the competitive ratio for is Noticing , decreases in and increases in and thus it attains its infimum at . Therefore, the optimal competitive ratio is The corresponding optimal strategy is .
Remark 2.2. Notice that and , as . Therefore, for the online leasing problem in a market without interest rate, the optimal deterministic competitive strategy is and its competitive ratio is 2, which coincides with the previous results .
3. A Randomized Strategy
In this section, we aim to construct a randomized competitive strategy, which is illustrated to be nearly optimal later. Let be a randomized strategy, where is the probability that the online player has bought the equipment until time . Then, is the probability that the online player has not bought the equipment until time . And we have that increases with time and .
On the time interval , the leasing fee is and the purchase fee is and thus the total fee of randomized strategy until time is In the following, we plan to construct a randomized strategy , such that for all , where is a constant to be determined.
When , (3.2) is
4. A Lower Bound for the Randomized Competitive Ratios
In this section, we pursuit the lower bound for the randomized competitive ratios by Yao's principle (see, e.g., ). To obtain the lower bound of , it is sufficient to choose any probability distribution over inputs and show that the ratio of the expected cost (in respect to ) of any online deterministic strategy to that of an optimal offline strategy is bounded from below by . Consider the input as a random variable, and assume that is any distribution of . By Yao's principle, the competitive ratio for any randomized strategy satisfies where and denote the expected costs of online strategy and an optimal offline strategy, respectively. The issue is to construct a probability distribution to make the right-hand-side of (4.1) as large as possible.
Theorem 4.1. For the leasing problem in a market with compound interest rate , a lower bound for the randomized competitive ratios is
Proof. Construct a probability distribution over inputs as follows:
which is of mixed type. It is of continuous type in , and its density function is
while it is of discrete type at and the probability that takes value is . Therefore, the expected cost of the optimal offline strategy is
In the following, we compute the expected cost of online strategy in three cases.
Case 1. . In this case, the expected cost of online strategy is Case 2. . In this case, the expected cost of online strategy is where the inequality is owed to .Case 3. . In this case, the expected cost of online strategy is Therefore, the competitive ratio for any randomized strategy satisfies
Remark 4.2. It naturally holds that the lower bound for the competitive ratios is less than the upper bound obtained in Section 3; that is, for , which can be verified by direct calculation.
Remark 4.3. As the interest rate tends to 0, the lower and upper bounds for the randomized competitive ratios tend to the same limit; that is, That is, when , the limit is just the optimal randomized competitive ratio, and the corresponding randomized strategy is
5. Numerical Analysis
In this section, we provide some numerical examples for exploiting the effect of the interest rate on the competitive strategies and competitive ratios we obtained above. Assume , and thus . Denote the optimal deterministic competitive ratio, the upper and lower bounds for the randomized competitive ratios by , and , respectively; that is,
First, we consider the effect of the interest rate on deterministic and randomized strategies. In Table 1, we can see that the larger is, the larger is. In fact, increases with , which can be derived from (2.6). In Figure 1, we can see that, for fixed time , the larger is, the smaller is. In fact, decreases with . We can conclude that the interest rate puts off the purchase dates of both the optimal deterministic strategy and the randomized strategy we obtained above. The reason is that it may be worthwhile to delay a purchase and increase the value of the capital over time in a market with interest rate.
Next, we consider the effect of the interest rate on competitive ratios. In Table 1, we see that the larger is, the smaller , and are. In fact, by direct calculation, we have that , and all decrease with . It indicates that the interest rate diminishes the uncertainty involved in online decision making. If , then we have , which is exactly the optimal randomized competitive ratio. Even if , there is no evident difference between and . So, we can say that the randomized competitive strategy we obtained in Section 3 is nearly optimal. For example, when , the percentage of the achieved competitive ratio beyond the optimal one is not more than .
In this paper, we have generalized the continuous version of the online leasing problem by introducing the compound interest rate. On the one hand, we obtained the optimal deterministic strategy and its competitive ratio; on the other hand, we constructed a nearly optimal randomized strategy and obtained a lower bound for the randomized competitive ratios. Moreover, thanks to numerical examples, we realized that the market interest rate postpones the purchase date and diminishes the uncertainty involved in the decision making. However, we fail to obtain the optimal randomized competitive ratio but its upper and lower bounds. We conjecture that the randomized competitive strategy we have obtained is exactly optimal, which will be verified in our future research.
This work was supported by the National Natural Science Foundation of China (nos. 70825005 and 70801027), China Postdoctoral Science Foundation (no. 20110490090), and GDUPS (2010).
- D. D. Sleator and R. E. Tarjan, “Amortized efficiency of list update and paging rules,” Communications of the ACM, vol. 28, no. 2, pp. 202–208, 1985.
- A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator, “Competitive snoopy caching,” Algorithmica, vol. 3, no. 1, pp. 79–119, 1988.
- A. R. Karlin, M. S. Manasse, L. A. McGeoch, and S. Owicki, “Competitive randomized algorithms for nonuniform problems,” Algorithmica, vol. 11, no. 6, pp. 542–571, 1994.
- A. R. Karlin, “On the performance of competitive algorithms in practice,” in Online Algorithms, vol. 1442 of Lecture Notes in Computer Science, pp. 373–384, Springer, Berlin, Germany, 1998.
- A. R. Karlin, C. Kenyon, and D. Randall, “Dynamic TCP acknowledgment and other stories about ,” Algorithmica, vol. 36, no. 3, pp. 209–224, 2003.
- R. El-Yaniv, “Competitive solutions for online financial problems,” ACM Computing Surveys, vol. 30, no. 1, pp. 28–69, 1998.
- T. M. Cover, “Universal portfolios,” Mathematical Finance, vol. 1, no. 1, pp. 1–29, 1991.
- R. El-Yaniv and R. M. Karp, “Nearly optimal competitive online replacement policies,” Mathematics of Operations Research, vol. 22, no. 4, pp. 814–839, 1997.
- R. Fleischer, “On the Bahncard problem,” Theoretical Computer Science, vol. 268, no. 1, pp. 161–174, 2001.
- Y. Zhang, W.-G. Zhang, W.-J. Xu, and X.-Y. Yang, “A new risk-reward model for one-way online trading,” Information, vol. 13, no. 5, pp. 1701–1709, 2010.
- A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, UK, 1998.
- S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, “On the power of randomization in on-line algorithms,” Algorithmica, vol. 11, no. 1, pp. 2–14, 1994.
- R. El-Yaniv, R. Kaniel, and N. Linial, “Competitive optimal on-line leasing,” Algorithmica, vol. 25, no. 1, pp. 116–140, 1999.
- S. al-Binali, “A risk-reward framework for the competitive analysis of financial games,” Algorithmica, vol. 25, no. 1, pp. 99–115, 1999.
- Y. F. Xu, W.-J. Xu, and H. Y. Li, “On the on-line rent-or-buy problem in probabilistic environments,” Journal of Global Optimization, vol. 38, no. 1, pp. 1–20, 2007.
Copyright © 2011 Xingyu Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.