Online bounded analysis

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results. Much work has gone into exploring other performance measures, in particular targeted at what seems to be the core problem with competitive analysis: the comparison of the performance of an online algorithm is made to a too powerful adversary. We consider a new approach to restricting the power of the adversary, by requiring that when judging a given online algorithm, the optimal offline algorithm must perform as well as the online algorithm, not just on the entire final request sequence, but also on any prefix of that sequence. This is limiting the adversary’s usual advantage of being able to exploit that it knows the sequence is continuing beyond the current request. Through a collection of online problems, including machine scheduling, bin packing, dual bin packing, and seat reservation, we investigate the significance of this particular offline advantage.

Original languageEnglish
Title of host publicationComputer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, Proceedings
EditorsGerhard J. Woeginger, Alexander S. Kulikov
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783319341705
StatePublished - 2016
Event11th International Computer Science Symposium in Russia, CSR 2016 - St. Petersburg, Russian Federation
Duration: 9 Jun 201613 Jun 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th International Computer Science Symposium in Russia, CSR 2016
Country/TerritoryRussian Federation
CitySt. Petersburg

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2016.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Online bounded analysis'. Together they form a unique fingerprint.

Cite this