Research project

The objective of our project is to establish principled methods for the design and analysis of online algorithms beyond the current techniques. We aim to develop tools to study convex and non-convex problems. Besides, we investigate new models that measure accurately the algorithm performance beyond the worst-case analysis. In particular, we are interested in the foundation of a general model of resource augmentation unifying previous apparently unrelated models.