Amortized efficiency of list update and paging rules
Communications of the ACM
Analysis of the Effects of Delays on Load Sharing
IEEE Transactions on Computers
On the value of information in distributed decision-making (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Closed-loop control with delayed information
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Lower bounds for on-line graph coloring
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A combined BIT and TIMESTAMP algorithm for the list update problem
Information Processing Letters
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
How useful is old information (extended abstract)?
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The statistical adversary allows optimal money-making trading strategies
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On page migration and other relaxed task systems
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Better Bounds for Online Scheduling
SIAM Journal on Computing
Competitive Distributed Decision-Making
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Global Optimization Using Local Information with Applications to Flow Control
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the on-line rent-or-buy problem in probabilistic environments
Journal of Global Optimization
The ski-rental problem with multiple discount options
Information Processing Letters
| Hi-index | 0.00 |
Most on-line analysis assumes that, at each time step, all relevant information up to that time step is available and a decision has an immediate effect. In many on-line problems, however, the time when relevant information is available and the time a decision has an effect may be decoupled. For example, when making an investment, one might not have completely up-to-date information on market prices. Similarly, a buy or sell order might only be executed some time in the future. We introduce and explore natural delayed models for several well-known on-line problems. Our analyses demonstrate the importance of considering timeliness in determining the competitive ratio of an on-line algorithm. For many problems, we demonstrate that there exist algorithms with small competitive ratios even when large delays affect the timeliness of information and the effect of decisions. Copyright 2001 Academic Press.