Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2011 (2011), Article ID 156254, 12 pages
http://dx.doi.org/10.1155/2011/156254
Research Article

Competitive Analysis for Online Leasing Problem with Compound Interest Rate

School of Business Administration, South China University of Technology, Guangzhou,Guangdong 510640, China

Received 23 May 2011; Accepted 18 June 2011

Academic Editor: Allan C Peterson

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.

Linked References

  1. 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. View at Publisher · View at Google Scholar
  2. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator, “Competitive snoopy caching,” Algorithmica, vol. 3, no. 1, pp. 79–119, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. 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. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. 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. View at Publisher · View at Google Scholar
  5. A. R. Karlin, C. Kenyon, and D. Randall, “Dynamic TCP acknowledgment and other stories about e/(e1),” Algorithmica, vol. 36, no. 3, pp. 209–224, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. R. El-Yaniv, “Competitive solutions for online financial problems,” ACM Computing Surveys, vol. 30, no. 1, pp. 28–69, 1998. View at Publisher · View at Google Scholar · View at Scopus
  7. T. M. Cover, “Universal portfolios,” Mathematical Finance, vol. 1, no. 1, pp. 1–29, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. 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. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. R. Fleischer, “On the Bahncard problem,” Theoretical Computer Science, vol. 268, no. 1, pp. 161–174, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. 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. View at Google Scholar
  11. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, Cambridge, UK, 1998.
  12. 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. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. R. El-Yaniv, R. Kaniel, and N. Linial, “Competitive optimal on-line leasing,” Algorithmica, vol. 25, no. 1, pp. 116–140, 1999. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. S. al-Binali, “A risk-reward framework for the competitive analysis of financial games,” Algorithmica, vol. 25, no. 1, pp. 99–115, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  15. 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. View at Publisher · View at Google Scholar