Stochastic dominance analysis of Online Bin Coloring algorithms

[1]  D. Daley.  Stochastically monotone Markov Chains , 1968 .

[2]  Pascal Schweitzer,et al.  Paging and list update under bijective analysis , 2009, SODA 2009.

[3]  Lutfi Al-Sharif,et al.  Elevator Traffic Handbook: Theory and Practice , 2003 .

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

[5]  Benjamin Hiller,et al.  Online Optimization: Probabilistic Analysis and Algorithm Engineering , 2010, OR.

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

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

[8]  A. Müller,et al.  Comparison Methods for Stochastic Models and Risks , 2002 .

[9]  Leen Stougie,et al.  Online Bin Coloring , 2001, ESA.

[10]  T. Lindvall.  Lectures on the Coupling Method , 1992 .

[11]  Luca Becchetti,et al.  Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm , 2006, Math. Oper. Res..

[12]  de We Willem Paepe,et al.  Complexity results and competitive analysis for vehicle routing problems , 2002 .

[13]  M. Doisy,et al.  A coupling technique for stochastic comparison of functions of Markov Processes , 2000, Adv. Decis. Sci..

[14]  Jinhui Xu,et al.  Almost Optimal Solutions for Bin Coloring Problems , 2005, ISAAC.

[15]  Michael Mitzenmacher,et al.  Bounds on the greedy routing algorithm for array networks , 1994, SPAA '94.

[16]  William J. Cook,et al.  Exact solutions to linear programming problems , 2007, Oper. Res. Lett..

[17]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[18]  Tjark Vredeveld,et al.  Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison , 2008, ESA.

[19]  Tjark Vredeveld,et al.  Probabilistic alternatives for competitive analysis , 2011, Computer Science - Research and Development.

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

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

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