TY - GEN
T1 - Non-additive two-option ski rental
AU - Levi, Amir
AU - Patt-Shamir, Boaz
PY - 2013
Y1 - 2013
N2 - We consider a generalization of the classical problem of ski rental. There is a game that ends at an unknown time, and the algorithm needs to decide how to pay for the time until the game ends. There are two "payment plans" or "options," such that the cost of t time units under option i (for i = 1, 2) is given by ait + bi , where bi is a one-time cost to start using option i, and ai is the ongoing cost per time unit. We assume w.l.o.g. that a1 > a2 and b1 < b2. (The classical version is b1 = 0 and a 2 = 0, so that option 1 is "pure rent" and option 2 is "pure buy.") We give deterministic and randomized algorithms for the general setting and prove matching lower bounds on the competitive ratios for the problem. This is the first non-trivial result for the non-additive model of ski rental, which models non-refundable one-time costs.
AB - We consider a generalization of the classical problem of ski rental. There is a game that ends at an unknown time, and the algorithm needs to decide how to pay for the time until the game ends. There are two "payment plans" or "options," such that the cost of t time units under option i (for i = 1, 2) is given by ait + bi , where bi is a one-time cost to start using option i, and ai is the ongoing cost per time unit. We assume w.l.o.g. that a1 > a2 and b1 < b2. (The classical version is b1 = 0 and a 2 = 0, so that option 1 is "pure rent" and option 2 is "pure buy.") We give deterministic and randomized algorithms for the general setting and prove matching lower bounds on the competitive ratios for the problem. This is the first non-trivial result for the non-additive model of ski rental, which models non-refundable one-time costs.
KW - Competitive analysis
KW - Online computation
UR - http://www.scopus.com/inward/record.url?scp=84893014803&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-03578-9_7
DO - 10.1007/978-3-319-03578-9_7
M3 - منشور من مؤتمر
SN - 9783319035772
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 80
EP - 91
BT - Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers
T2 - 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013
Y2 - 1 July 2013 through 3 July 2013
ER -