An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
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
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
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
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
The Competitive Analysis of Risk Taking with Applications to Online Trading
FOCS '97 Proceedings of the 38th 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
Beyond competitive analysis [on-line algorithms]
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Using generalized forecasts for online currency conversion
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Bypass Caching: Making Scientific Databases Good Network Citizens
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Estimating query result sizes for proxy caching in scientific database federations
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
On the on-line rent-or-buy problem in probabilistic environments
Journal of Global Optimization
Workload-Aware Histograms for Remote Applications
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Dynamic coprocessor management for FPGA-enhanced compute platforms
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
The on-line rental problem with risk and probabilistic forecast
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
On the on-line k-taxi problem with limited look ahead
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Dynamic acceleration management for SystemC emulation
ACM SIGBED Review - Special Issue on the 2nd International Workshop on Adaptive and Reconfigurable Embedded Systems (APRES'09)
Price fluctuations: to buy or to rent
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Query execution timing: taming real-time anytime queries on multicore processors
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
Let s be the ratio of the cost for purchasing skis over the cost for renting them. Then the famous result for the ski-rental problem shows that skiers should buy their skis after renting them (s - 1) times, which gives us an optimal competitive ratio of 2 - 1/s. In practice, however, it appears that many skiers buy their skis before this optimal point of time and also many skiers keep renting them forever. In this paper we show that these behaviors of skiers are quite reasonable by using an average-case competitive ratio. For an exponential input distribution f(t) = 驴e-驴t, optimal strategies are (i) if 1/驴 驴 s, then skiers should rent their skis forever and (ii) otherwise should purchase them after renting approximately s2驴 (s) times. Thus average-case competitive analyses give us the result which differs from the worst-case competitive analysis and also differs from the traditional average cost analysis. Other distributions and related problems are also discussed.