# Weighted Congestion Games - Existence, Efficiency and Complexity of pure Nash equilibria

## Martin Gairing

*Abstract*

*Speaker's Bio*

Martin is Head of the Economics and Computation Research Group and Deputy Head of the Computer Science Department at the University of Liverpool. Before joining Liverpool in 2009, Martin completed his PhD at the University of Paderborn in 2006 and a postoctoral fellowship at the International Computer Science Institute (ICSI) in Berkeley under the supervision of Richard Karp.

Martin’s expertise lies in the area of Algorithmic Game theory, which is at intersection of Theoretical Computer Science and Economic Game Theory. His research shaped the theory of congestion games, a fundamental model for selfish behaviour in networks. In particular, Martin is well known for his contributions on quantifying the inefficiency of Nash equilibria in congestion games.

Martin applied game theoretic concepts also to other fields. E.g., he contributed to the design of improved approximation algorithms for scheduling problems, general covering problems, network design problems, and reachability problems.