Competitive optimal on-line leasing

Algorithmica (New York)

Volumn 25, Issue 1, 1999, Pages 116-140

  El Yaniv, R ^a   Kaniel, R ^b   Linial, N ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Competitive analysis; Equipment rental; Lease or buy problem; Leasing; On line algorithms; Ski rental

Indexed keywords

EID: 0013087262     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009279     Document Type: Article

References (40)

1. A. Abel. Asset prices under habit formation and catching up with the Joneses. American Economic Review, 80:43-47, May 1990.
2. E. J. Anderson and P. Nash. Linear Programming in Infinite Dimentions. Wiley, Chichester, 1987.
3. P. Auer, N. Cesa-Bianchi, Y. Freund, and R.E. Schapire. Gambling in a rigged casino: the adversarial multi-armed bandit problem. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 322-331, 1995.
4. B. Awerbuch, Y. Azar, A. Fiat, and T. Leighton. Making commitments in the face of uncertainty: how to pick a winner almost every time. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996.
5. Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi, and A. Rosén. On capital investment. In Proceedings of 23rd ICALP, pages 429-441, 1996.
6. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Widgerson. On the power of randomization in on-line algorithms. In Proceedings of the 22nd Symposium on Theory of Algorithms, pages 379-386, 1990.
7. S. al-Binali. The competitive analysis of risk taking with application to online trading. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997.
8. A. Blum and A. Kalai. Universal portfolios with and without transaction costs. In Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997.
9. A. Borodin and R. El-Yaniv. On randomization in online computation. In Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, pages 226-238, June 1997.
10. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. Journal of the ACM, 39:745-763, 1992.
11. R.S. Bower. Issues in lease financing. Financial Management, 2:25-33, 1973.
12. R. Brealey and S. Myers. Principles of Corporate Finance. McGraw-Hill, New York, 1996.
13. A. Chou, J. Cooperstock, R. El-Yaniv, M. Klugerman, and T. Leighton. The statistical adversary allows optimal money-making trading strategies. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995.
14. A. Chou, A. Shrivastava, and R. Sidney. On the power of magnitude. Unpublished manuscript, May 1995.
15. T.M. Cover. Universal portfolios. Mathematical Finance, 1(1):1-29, January 1991.
16. T.M. Cover and E. Ordentlich. Universal portfolios with side information. IEEE Transactions on Information Theory, March 1996.
17. R. El-Yaniv, A. Fiat, R.M. Karp, and G. Turpin. Competitive analysis of financial games. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 327-333, 1992.
18. R. El-Yaniv and R.M. Karp. Nearly optimal competitive online replacement policies. Mathematics of Operations Research, 22(4):814-839, 1997.
19. J.R. Franks and S.D. Hodges. Valuation of financial lease contracts: a note. Journal of Finance, pages 657-660, May 1978.
20. J. Gali. Keeping up with the Joneses: consumption externalities, portfolio choice, and asset prices. Journal of Money, Credit, and Banking, 26:1-8, February 1994.
21. R.L. Graham. Bounds for certain multiprocessor anomalies. Bell Systems Technical Journal, 45:153-1581, 1966.
22. D.P. Helmbold, R.E. Schapire, Y. Singer, and M.K. Warmuth. On-line portfolio selecting using multiplicative updates, April 1996. To appear in Mathematical Finance.
23. F. Jamshidian. Asymptotically optimal portfolios. Mathematical Finance, 2(2):131-150, 1992.
24. D.S. Johnson. Near-optimal bin packing algorithms. Ph.D. thesis, Massachusetts Institute of Technology, 1973.
25. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3:299-325, 1974.
26. R.W. Johnson and W.G. Lewellen. Analysis of the lease-or-buy decision. Journal of Finance, 27:815-824, September 1972.
27. R. Kaniel. On the equipment rental problem. Master's thesis, Department of Computer Science, The Hebrew University of Jerusalem, July 1994.
28. A. Karlin, M.S. Manasse, L.A. McGeoch, and S. Owicki. Competitive randomized algorithms for non-uniform problems. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, pages 300-309, 1990.
29. A.R. Karlin, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):70-119, 1988.
30. R.M. Karp, R. Ostrovski, and Y. Rabani. 1993. Personal communication.
31. J.J. McConnell and J.S. Schallheim. Valuation of asset leasing contracts. Journal of Financial Economics, 12:237-262, August 1983.
32. M.H. Miller and C.W. Upton. Leasing, buying and the cost of capital services. Journal of Finance, 31:761-786, June 1976.
33. S. Myers, D.A. Dill, and A.J. Bautista. Valuation of financial lease contracts. Journal of Finance, 31:799-820, June 1976.
34. E. Ordentlich and T.M. Cover. On-line portfolio selection. In COLT 96, 1996.
35. P. Raghavan. A statistical adversary for on-line algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 7, pages 79-83, 1992.
36. L. Rudolph. Personal communication, 1994.
37. L.D. Schall. The lease-or-buy and asset acquisition decisions. Journal of Finance, 29:1203-1214, September 1974.
38. D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985:
39. C.W. Smith Jr. and L.M. Wakeman. Determinations of corporate leasing policy. Journal of Finance, 40:895-910, July 1985.
40. A.C. Yao. New algorithms for bin packing. Journal of the ACM, 27:207-227, 1980.