A member lab of REQS LabsVisit REQS Labs

Research programme

A useful algorithm begins with structure—and ends with a guarantee.

Theory Lab studies the mathematical foundations of efficient decision-making: algorithms, optimization, complexity, and strategic interaction under uncertainty.

01

Algorithms and complexity

Design and analysis of provably efficient algorithms, with attention to the structural boundary between tractable and intractable problems.

  • Which structural restrictions turn an intractable problem into a tractable one?
  • When can enumeration be performed with polynomial delay or incremental efficiency?
  • Which lower bounds explain the limit of an algorithmic approach?
  • How should theoretical guarantees guide practical implementation?

02

Optimization under uncertainty

Continuous, discrete, and robust optimization for problems whose data, constraints, or objectives cannot be treated as perfectly known.

  • Which convex or discrete structure supports algorithms at large scale?
  • How should uncertainty sets preserve both robustness and computational efficiency?
  • When do relaxations and rounding retain meaningful guarantees?
  • What can approximation schemes deliver that general-purpose solvers cannot?

03

Games, incentives, and multi-agent decisions

Algorithmic study of strategic systems: mechanisms, pricing, stochastic games, and decisions shaped by the behaviour of other agents.

  • Which equilibria or strategies can be computed efficiently?
  • How do limited information and uncertainty change strategic guarantees?
  • Can approximation algorithms support truthful or stable mechanisms?
  • Where do individual incentives undermine system-level performance?

04

Theory for high-impact systems

Mathematical methods for power, logistics, machine learning, and autonomous systems where scale and uncertainty make naive optimization unreliable.

  • Which domain constraints reveal a new general optimization problem?
  • How can power-system or logistics models retain physical meaning after relaxation?
  • What guarantees remain useful when an algorithm meets noisy real-world data?
  • How should theory, implementation, and empirical evaluation inform one another?