TY - GEN

T1 - Rent, lease or buy

T2 - 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

AU - Lotker, Zvi

AU - Patt-Shamir, Boaz

AU - Rawitz, Dror

PY - 2008/1/1

Y1 - 2008/1/1

N2 - 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.

AB - 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.

KW - Competitive analysis

KW - Randomized algorithms

KW - Ski rental

UR - http://www.scopus.com/inward/record.url?scp=45749084512&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:45749084512

SN - 9783939897064

T3 - Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

SP - 503

EP - 514

BT - Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

PB - IBFI Schloss Dagstuhl

Y2 - 21 February 2008 through 23 February 2008

ER -