Online-bounded analysis

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.

[1]  Joan Boyar,et al.  The Seat Reservation Problem , 1999, Algorithmica.

[2]  Susanne Albers,et al.  On paging with locality of reference , 2002, STOC '02.

[3]  Neal Young,et al.  The K-Server Dual and Loose Competitiveness for Paging , 1991, On-Line Algorithms.

[4]  Prabhakar Raghavan,et al.  A Statistical Adversary for On-line Algorithms , 1991, On-Line Algorithms.

[5]  Anna R. Karlin,et al.  Markov Paging , 2000, SIAM J. Comput..

[6]  Yossi Azar,et al.  On-line bin-stretching , 1998, Theor. Comput. Sci..

[7]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[8]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[9]  Allan Borodin,et al.  A new measure for the study of on-line algorithms , 2005, Algorithmica.

[10]  Neal E. Young,et al.  Competitive paging and dual-guided algorithms for weighted caching and matching (Thesis) , 1991 .

[11]  Joan Boyar,et al.  The Accommodating Function: A Generalization of the Competitive Ratio , 2001, SIAM J. Comput..

[12]  Gerhard J. Woeginger,et al.  A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..

[13]  Neal E. Young,et al.  Competitive paging and dual-guided on-line weighted caching and watching algorithms , 1992 .

[14]  Yossi Azar,et al.  Fair versus Unrestricted Bin Packing , 2002, Algorithmica.

[15]  Yossi Azar,et al.  On-Line Machine Covering , 1997, ESA.

[16]  Kim S. Larsen,et al.  List Factoring and Relative Worst Order Analysis , 2012, Algorithmica.

[17]  Allan Borodin,et al.  Competitive paging with locality of reference , 1991, STOC '91.

[18]  Leah Epstein,et al.  Online-bounded analysis , 2018, J. Sched..

[19]  Shuichi Miyazaki,et al.  Improving the Competitive Ratios of the Seat Reservation Problem , 2010, IFIP TCS.

[20]  David S. Johnson.  The NP-completeness column: Finding needles in haystacks , 2007, TALG.

[21]  Sartaj Sahni,et al.  Bounds for List Schedules on Uniform Processors , 1980, SIAM J. Comput..

[22]  Alejandro López-Ortiz,et al.  On the relative dominance of paging algorithms , 2007, Theor. Comput. Sci..

[23]  Leah Epstein.  Tight bounds for bandwidth allocation on two links , 2005, Discret. Appl. Math..

[24]  Elias Koutsoupias,et al.  Competitive analysis of maintaining frequent items of a stream , 2012, Theor. Comput. Sci..

[25]  Joan Boyar,et al.  Advice Complexity for a Class of Online Problems , 2015, STACS.

[26]  Susanne Albers,et al.  On the Influence of Lookahead in Competitive Paging Algorithms , 1997, Algorithmica.

[27]  Leah Epstein,et al.  Separating online scheduling algorithms with the relative worst order ratio , 2006, J. Comb. Optim..

[28]  Tao Jiang,et al.  Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem , 2003, J. Sched..

[29]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[30]  Christos H. Papadimitriou,et al.  Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[31]  Joan Boyar,et al.  The Relative Worst Order Ratio for On-Line Algorithms , 2003, CIAC.

[32]  Lap-Kei Lee,et al.  Sleep Management on Multiple Machines for Energy and Flow Time , 2011, ICALP.

[33]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[34]  C. Kenyon.  Best-fit bin-packing with random order , 1996, SODA '96.

[35]  Alejandro López-Ortiz,et al.  On the Separation and Equivalence of Paging Strategies and Other Online Algorithms , 2018, Algorithmica.

[36]  Gerhard J. Woeginger,et al.  Randomized online scheduling on two uniform machines , 2001, SODA '99.

[37]  Joan Boyar,et al.  The relative worst order ratio for online algorithms , 2007, TALG.

[38]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[39]  Dany Breslauer,et al.  On Competitive On-Line Paging with Lookahead , 1995, Theor. Comput. Sci..

[40]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[41]  Joan Boyar,et al.  Extending the accommodating function , 2003, Acta Informatica.

[42]  János Csirik,et al.  Online algorithms for a dual version of bin packing , 1988, Discret. Appl. Math..