Interdependent combinatorial optimization in complex systems

Program Code: 

Prof Hussein Abbass (

Description of Work: 


This project aims at understanding the dynamics of interdependency between combinatorial optimization problems. In complex systems, it is natural that two or more sub-systems are interconnected. Each of these sub-systems attempts to optimize its own performance. However, the optimal solution for one sub-system depends on the optimal solution for the other sub-systems. This interdependency is not understood well in the combinatorial optimization literature. This project will make a breakthrough in this area.

Description of Work:

  • Understanding what makes a combinatorial optimization problem hard
  • Developing a framework for analysing interdependency of combinatorial optimization problems
  • Developing methodologies for solving interdependent combinatorial optimization problems.
  • Testing the competitiveness of the different methodologies.