In life, we sometimes have to make decisions without all the information we want; that’s true in computer science, too. This is the realm of online algorithms — which, despite their name, don’t ...

Online algorithms are designed to make decisions sequentially, without complete knowledge of future inputs. In many real-world applications—from scheduling and resource allocation to network ...

Online learning and competitive analysis are two widely studied frameworks for online decision-making settings. Despite the frequent similarity of the problems they study, there are significant ...

Online algorithms are central to solving resource allocation and matching challenges in dynamic environments where decisions must be made without complete knowledge of future events. Research in this ...