Competitive Analysis for Multi-objective Online Algorithms
So far, the concept of competitive analysis for online problems is in general applied to single-objective online problems. However, many online problems can be extended to multi-objective online problems in a natural way, but a uniform theory for the analysis of these problems is not provided in the literature. We expand the concept of competitive analysis to multi-objective online problems and achieve a consistent framework for the analysis of multi-objective online problems. Furthermore, we analyze the multi-objective time series search problem and present deterministic algorithms with best possible competitive ratios.
Keywordscompetitive analysis online optimization multi-objective optimization time series search
Unable to display preview. Download preview PDF.
- 2.Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)Google Scholar
- 3.Ehrgott, M.: Multicriteria Optimization. Springer (2005)Google Scholar
- 9.Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the 29th ACM Symposium on the Theory of Computing (STOC), pp. 140–149 (1997)Google Scholar