Average-Case Competitive Analyses for Ski-Rental Problems

AbstractLet s be the ratio of the cost for purchasing skis over the cost for renting them. Then the famous result for the ski-rental problem shows that skiers should buy their skis after renting them (s - 1) times, which gives us an optimal competitive ratio of 2 - 1/s. In practice, however, it appears that many skiers buy their skis before this optimal point of time and also many skiers keep renting them forever. In this paper we show that this behavior of skiers is quite reasonable by using an average-case competitive ratio. For an exponential input distribution f(t) = λ e-λt, optimal strategies are (i) if 1/λ \leq s, then skiers should rent their skis forever and (ii) otherwise they should purchase them after renting approximately s2λ (<s) times. Thus average-case competitive analyses give us the result which differs from the worst-case competitive analysis and also differs from the traditional average cost analysis. Other distributions and related problems are also discussed.

[1]  Ran El-Yaniv,et al.  Competitive analysis of financial games , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

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

[4]  Sally A. Goldman,et al.  TCP Dynamic Acknowledgment Delay: Theory and Practice (Extended Abstract). , 1998, STOC 1998.

[5]  Sabah al-Binali,et al.  The competitive analysis of risk taking with applications to online trading , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[6]  Claire Mathieu,et al.  Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.

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

[8]  Marek Chrobak,et al.  LRU Is Better than FIFO , 1999, SODA '98.

[9]  Magnús M. Halldórsson,et al.  Online independent sets , 2000, Theor. Comput. Sci..

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[12]  Allan Borodin,et al.  Competitive paging with locality of reference , 1991, STOC '91.

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

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

[15]  Rudolf Fleischer.  On The Bahncard Problem , 1998, COCOON.

[16]  Christos H. Papadimitriou,et al.  Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.