A Comparison of Performance Measures via Online Search
Since the introduction of competitive analysis, a number of alternative measures for the quality of online algorithms have been proposed, but, with a few exceptions, these have generally been applied only to the online problem for which they were developed. Recently, a systematic study of performance measures for online algorithms was initiated [Boyar, Irani, Larsen: WADS 2009], first focusing on a simple server problem. We continue this work by studying a fundamentally different online problem, online search, and the Reservation Price Policies in particular. The purpose of this line of work is to learn more about the applicability of various performance measures in different situations and the properties that the different measures emphasize. We investigate the following analysis techniques: Competitive, Relative Worst Order, Bijective, Average, Relative Interval, and Random Order. In addition, we have established the first optimality proof for Relative Interval Analysis.
Unable to display preview. Download preview PDF.
- 1.Angelopoulos, S., Dorrigiv, R., López-Ortiz, A.: On the separation and equivalence of paging strategies. In: 18th Symposium on Discrete Algorithms, pp. 229–237. Philadelphia, PA, USA (2007)Google Scholar
- 4.Boyar, J., Favrholdt, L.M.: The relative worst order ratio for online algorithms. ACM Transactions on Algorithms 3(2), article 22(2007)Google Scholar
- 7.Boyar, J., Larsen, K.S., Maiti, A.: A comparison of performance measures via online search. Tech. Rep. arXiv:1106.6136v1 [cs.DS], arXiv (2011)Google Scholar
- 8.Chen, G.H., Kao, M.Y., Lyuu, Y.D., Wong, H.K.: Optimal buy-and-hold strategies for financial markets with bounded daily returns. SIAM Journal on Computing 31(2) (2001)Google Scholar
- 14.Kenyon, C.: Best-fit bin-packing with random order. In: 7th Symposium on Discrete Algorithms, pp. 359–364 (1996)Google Scholar