We will investigate the underlying, fundamental, algorithmic and complexity-theoretic aspects of co-operation and optimization in dynamic, complex, global environments, by providing efficient, robust and scalable algorithmic solutions and by showing lower bounds in appropriate models. In particular, the research will focus on the following aspects of sharing critical resources and achieving co-operation in global systems: 

• the efficient assignment of frequencies and the call admission control in wireless cellular networks

• the minimization of energy consumption in wireless networks (such as ad-hoc wireless networks), by proposing power assignment algorithms for fast and reliable communication (e.g., broadcasting, multicasting and gossiping)

• sharing common resources (like CPU time, space, and communication time) on the Internet among selfish agent entities

• the efficient scheduling on bandwidth requests in ATM networks and data retrieval requests in parallel data servers, by giving approximation algorithms and lower bounds

• the efficient access to optical bandwidth in WDM networks

To achieve these goals, we will combine (and extend) in a novel way and in a new context, state-of-the-art algorithmic, combinatorial, complexity-theoretic and modeling techniques. We will also follow a multidisciplinary approach, by properly combining techniques and notions from Theoretical Computer Science, Game Theory and Economics, and Operations Research.