A Comparison of Performance Measures via Online Search

Joan Boyar, Kim Skak Larsen, Abyayananda Maiti

Research output: Contribution to journalConference articleResearchpeer-review

Abstract

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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Volume7285
Pages (from-to)303-314
Number of pages12
ISSN0302-9743
DOIs
Publication statusPublished - 2012
EventFrontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference - Beijing, China
Duration: 14. May 201216. May 2012

Conference

ConferenceFrontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference
Country/TerritoryChina
CityBeijing
Period14/05/201216/05/2012

Fingerprint

Dive into the research topics of 'A Comparison of Performance Measures via Online Search'. Together they form a unique fingerprint.

Cite this