SIGACT News Online Algorithms Column 1 Marek Chrobak Department of Computer Science University of California, Riverside marek@cs.ucr.edu Welcome Welcome to the new SIGACT News column on online algorithms. It has been now 16 years since the term competitive online algorithm appeared in the literature for the rst time [10]. We have survived puberty, and quite smoothly so. Competitive analysis has become a standard tool among theoreticians, and is steadily gaining acceptance among researchers in application areas. It has been applied to a wide variety of online problems in scheduling, navigation, nance, network optimization, and other areas. I hope this column will contribute to further growth of our area, toward full maturity. The inspiration for creating this column came from recent advances in the competitive analysis of online optimization problems. However, I would like to make the scope of this column broader, and cover other related topics. These would include, for example, alternative performance measures for online problems (stochastic models, di use adversary models, loose competitiveness, resource augmentation, etc). The spirit of competitive analysis can be found in other research on computing with partial information, for example in distributed computing [1] or in recent work on sel sh
/lp/association-for-computing-machinery/sigact-news-online-algorithms-column-1-fSHdDN6f27