Rent, lease or buy: Randomized algorithms for multislope Ski rental

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

Volumn , Issue , 2008, Pages 503-514

  Lotker, Zvi ^a   Patt Shamir, Boaz ^b   Rawitz, Dror ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

Competitive analysis; Randomized algorithms; Ski rental

Indexed keywords

ONLINE SYSTEMS;

COMPETITIVE ANALYSIS; NATURAL GENERALIZATION; ONLINE COMPUTATIONS; ONLINE DECISIONS; RANDOMIZED ALGORITHMS; RANDOMIZED STRATEGY; SKI RENTAL; SKI-RENTAL PROBLEMS;

COSTS;

EID: 45749084512     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. J. Aspnes, Y. Azar, A. Fiat, S. A. Plotkin, and O. Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3):486-504, 1997.
2. J. Augustine, S. Irani, and C. Swamy. Optimal power-down strategies. In 45th IEEE Symp. on Foundations of Computer Science, pages 530-539, 2004.
3. Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi, and A. Rosén. On capital investment. Algorithmica, 25(1):22-36, 1999.
4. Y. Bejerano, I. Cidon, and J. S. Naor. 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, pages 65-74. ACM, 2000.
5. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
6. P. Damaschke. Nearly optimal strategies for special cases of on-line capital investment. Theoretical Computer Science, 302(1-3):35-44, 2003.
7. S. Gal. Search Games. Academic Press, 1980.
8. S. Irani, R. K. Gupta, and S. K. Shukla. Competitive analysis of dynamic power management strategies for systems with multiple power savings states. In Design, Automation and Test in Europe Conference and Exhibition, pages 117-123, 2002.
9. A. R. Karlin, C. Kenyon, and D. Randall. Dynamic TCP acknowledgment and other stories about e/(e - 1). Algorithmica, 36(3):209-224, 2003.
10. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):77-119, 1988.
11. A. W. Marshall and I. Olkin. Inequalities: Theory of Majorization and Its Applications. Academic Press, 1979.
12. A. Meyerson. The parking permit problem. In 46th IEEE Symp. on Foundations of Computer Science, pages 274-284, 2005.
13. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. Theor. Comput. Sci., 130(1):17-47, 1994.