TY - GEN
T1 - Online bounded analysis
AU - Boyar, Joan
AU - Epstein, Leah
AU - Favrholdt, Lene M.
AU - Larsen, Kim S.
AU - Levin, Asaf
N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84977586992&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-34171-2_10
DO - 10.1007/978-3-319-34171-2_10
M3 - Conference contribution
SN - 9783319341705
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 131
EP - 145
BT - Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, Proceedings
A2 - Woeginger, Gerhard J.
A2 - Kulikov, Alexander S.
PB - Springer Verlag
T2 - 11th International Computer Science Symposium in Russia, CSR 2016
Y2 - 9 June 2016 through 13 June 2016
ER -