Competitive solutions for online financial problems
ACM Computing Surveys (CSUR)
TCP dynamic acknowledgment delay (extended abstract): theory and practice
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Competitive randomized algorithms for non-uniform problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Average-Case Competitive Analyses for Ski-Rental Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Nearly optimal strategies for special cases of on-line capital investment
Theoretical Computer Science
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Competitive analysis of financial games
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Dynamic right-sizing for power-proportional data centers
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We extend the classic online ski rental problem, so that the rental price may change over time. We consider several models which differ in the knowledge given to the algorithm: whereas the price development is unknown, an algorithm may have full, partial or no knowledge about the duration of the game. We construct algorithms whose competitive ratios are up to constant or logarithmic factors optimal.