Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental

In the Multislope Ski Rental problem, the user needs a certain resource for some unknown period of time. To use the resource, the user must subscribe to one of several options, each of which consists of a one-time setup cost (``buying price''), and cost proportional to the duration of the usage (``rental rate''). The larger the price, the smaller the rent. The actual usage time is determined by an adversary, and the goal of an algorithm is to minimize the cost by choosing the best option at any point in time. Multislope Ski Rental is a natural generalization of the classical Ski Rental problem (where the only options are pure rent and pure buy), which is one of the fundamental problems of online computation. The Multislope Ski Rental problem is an abstraction of many problems where online decisions cannot be modeled by just two options, e.g., power management in systems which can be shut down in parts. In this paper we study randomized algorithms for Multislope Ski Rental. Our results include the best possible online randomized strategy for any additive instance, where the cost of switching from one option to another is the difference in their buying prices; and an algorithm that produces an $e$-competitive randomized strategy for any (non-additive) instance.

[1]  Amos Fiat,et al.  On Capital Investment , 1996, ICALP.

[2]  Peter Damaschke.  Nearly optimal strategies for special cases of on-line capital investment , 2003, Theor. Comput. Sci..

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

[4]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

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

[6]  Rajeev Motwani,et al.  Non-clairvoyant scheduling , 1994, SODA '93.

[7]  John Augustine,et al.  Optimal power-down strategies , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

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

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

[10]  P. Hudson.  Search Games , 1982 .

[11]  Adam Meyerson.  The parking permit problem , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[12]  Claire Mathieu,et al.  Dynamic TCP Acknowledgment and Other Stories about e/(e - 1) , 2003, Algorithmica.

[13]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[14]  Joseph Naor,et al.  Dynamic session management for static and mobile users: a competitive on-line algorithmic approach , 2000, DIALM '00.

[15]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[16]  Sandy Irani,et al.  Competitive analysis of dynamic power management strategies for systems with multiple power saving states , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.