Abstract
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 a i t + b i , where b i is a one-time cost to start using option i, and a i is the ongoing cost per time unit. We assume w.l.o.g. that a 1 > a 2 and b 1 < b 2. (The classical version is b 1 = 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.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-03578-9_29
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Augustine, J., Irani, S., Swamy, C.: Optimal power-down strategies. SIAM J. Comput. 37(5), 1499–1516 (2008)
Bejerano, Y., Cidon, I., Naor, J.S.: Dynamic session management for static and mobile users: a competitive on-line algorithmic approach. In: 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 65–74. ACM (2000)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)
Fleischer, R.: On the bahncard problem. Theoretical Comput. Sci. 268(1), 161–174 (2001)
Fujiwara, H., Kitano, T., Fujito, T.: On the best possible competitive ratio for multislope ski rental. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 544–553. Springer, Heidelberg (2011)
Karlin, A., Manasse, M., Rudolph, L., Sleator, D.: Competitive snoopy caching. Algorithmica 3(1), 79–119 (1988)
Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgment and other stories about e/(e − 1). Algorithmica 36(3), 209–224 (2003)
Karlin, A.R., Manasse, M.S., McGeoch, L.A., Owicki, S.: Competitive randomized algorithms for non-uniform problems. In: Proc. First Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA 1990, pp. 301–309. SIAM, Philadelphia (1990)
Levi, A., Patt-Shamir, B.: Simplest non-additive ski rental (Unpublished manuscript)
Lotker, Z., Patt-Shamir, B., Rawitz, D.: Ski rental with two general options. Inf. Process. Lett. 108(6), 365–368 (2008)
Lotker, Z., Patt-Shamir, B., Rawitz, D.: Rent, lease, or buy: Randomized algorithms for multislope ski rental. SIAM J. Discrete Math. 26(2), 718–736 (2012)
Wolfram Research, Inc. Mathematica version 7.0 (2008)
Yao, A.C.: Probabilistic computations: toward a unified measure of complexity. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 222–227 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levi, A., Patt-Shamir, B. (2013). Non-Additive Two-Option Ski Rental. In: Moscibroda, T., Rescigno, A.A. (eds) Structural Information and Communication Complexity. SIROCCO 2013. Lecture Notes in Computer Science, vol 8179. Springer, Cham. https://doi.org/10.1007/978-3-319-03578-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-03578-9_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03577-2
Online ISBN: 978-3-319-03578-9
eBook Packages: Computer ScienceComputer Science (R0)