While methods for optimization under uncertainty have been studied intensely over the past
decades, the explicit consideration of the interplay between uncertainty and time has gained …

In online scenarios requests arrive over time, and each request must be serviced in an
irrevocable manner before the next request arrives. Online algorithms with advice is an area …

The advice model of online computation captures the setting in which the online algorithm is
given some information concerning the request sequence. This paradigm allows to establish …

What is information? Frequently spoken about in many contexts, yet nobody has ever been
able to define it with mathematical rigor. The best we are left with so far is the concept of …

The design of online algorithms has tended to focus on algorithms with worst-case
guarantees, eg, bounds on the competitive ratio. However, it is well-known that such …

Online algorithms with advice is an area of research where one attempts to measure how
much knowledge of the future is necessary to achieve a given competitive ratio. The lower …

We study the advice complexity and the random bit complexity of the online knapsack
problem. Given a knapsack of unit capacity, and n items that arrive in successive time steps …

In this paper we introduce the\emph {semi-online} model that generalizes the classical
online computational model. The semi-online model postulates that the unknown future has …

Competitive analysis is the established tool for measuring the output quality of algorithms
that work in an online environment. Recently, the model of advice complexity has been …

We consider the online bin packing problem under the advice complexity model where the
“online constraint” is relaxed and an algorithm receives partial information about the future …