A comparison of performance measures via online search

DOI10.1007/978-3-642-29700-7_28MaRDI QIDQ2898005zbMATH OpenOpenAlexFDO

Authors Kim S. Larsen, Abyayananda Maiti, Joan Boyar

Publication date 16 July 2012

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.6136

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Abstract: Though competitive analysis has been a very useful performance measure for the quality of online algorithms, it is recognized that it sometimes fails to distinguish between algorithms of different quality in practice. A number of alternative measures have been proposed, but, with a few exceptions, these have generally been applied only to the online problem they were developed in connection with. Recently, a systematic study of performance measures for online algorithms was initiated [Boyar, Irani, Larsen: Eleventh International Algorithms and Data Structures Symposium 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, Random Order, and Max/Max. In addition to drawing conclusions on this work, we also investigate the measures' sensitivity to integral vs. real-valued domains, and as a part of this work, generalize some of the known performance measures. Finally, we have established the first optimality proof for Relative Interval Analysis.

Recommendations

• A comparison of performance measures via online search
• Analysis of threat based algorithm using different performance measures
• A new measure for the study of on-line algorithms

Cited in

(7)

• A comparison of performance measures via online search
• scientific article; zbMATH DE number 1670671 (Why is no real title available?)
• Analysis of threat based algorithm using different performance measures
• scientific article; zbMATH DE number 7559116 (Why is no real title available?)
• Online Bin Covering: Expectations vs. Guarantees
• Competitive analysis for multi-objective online algorithms
• Advice complexity of the online search problem

This page was built for publication: A comparison of performance measures via online search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898005)