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...

The issue of selfish routing through a network has received a lot of attention in recent years. We study an atomic dynamic routing scenario, where players allocate resources with load dependent costs only for some limited time.Our paper introduces a natural discrete version of the deterministic...