Delayed Information and Action in On-Line Algorithms |
| |
Authors: | Susanne Albers Moses Charikar Michael Mitzenmacher |
| |
Affiliation: | Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Georges-Köhler-Allee 79, Freiburg, 79110, Germanyf1;Computer Science Department, Stanford University, Stanford, California, 94305, , f2;Harvard University, 33 Oxford St. Cambridge, Massachusetts, 02138, , f3 |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|