Online Bounded Analysis

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-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, St. Petersburg, Russia, June 9-13, 2016, Proceedings
EditorsAlexander S. Kulikov, Gerhard J. Woeginger
Publication date2016
ISBN (Print)978-3-319-34170-5
ISBN (Electronic)978-3-319-34171-2
Publication statusPublished - 2016
Event11th International Computer Science Symposium in Russia - St. Petersburg, Russian Federation
Duration: 9. Jun 201613. Sept 2016


Conference11th International Computer Science Symposium in Russia
Country/TerritoryRussian Federation
CitySt. Petersburg
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Online Bounded Analysis'. Together they form a unique fingerprint.

Cite this