Online resource management

In this thesis, we consider several problems related to online resource management. In online optimization, an algorithm has to make decisions based on a sequence of incoming bits of information without knowledge of future inputs. We apply the well-established concept of competitive analysis in order to measure the quality of an online algorithm. First, we analyze an online knapsack problem with incremental capacity which extends the basic online knapsack problem by introducing a dynamic instead of a static knapsack capacity. This setting is applicable to classic problems such as resource a...