معرفی
Professor Martin Gairing is an academic faculty member with a focus on Game Theory, Congestion Games, and Network Design. His research explores the Efficiency and Complexity of equilibria in algorithmic contexts, particularly in transportation and distributed systems. He has secured grants from the Engineering & Physical Sciences Research Council (EPSRC) and Alder Hey Children's NHS Foundation Trust for projects like MRI Image Analysis (MaRIA) and Algorithms for Approximate Nash Equilibria.
His recent work includes In Congestion Games, Taxes Achieve Optimal Approximation (2023), which examines taxation strategies for optimizing network efficiency. Other key publications span topics such as Dynamic Traffic Models, Fair Interventions, and Price of Stability in weighted and polynomial congestion games.
He has taught modules including
- Cloud Computing for E-Commerce (COMP315)
- Computer Forensics (COMP343)
- Computer Networks (COMP211)
- Introduction To Programming (COMP101)
- Robot Perception and Manipulation (COMP341)
Grants and research projects include
- MRI Image Analysis (MaRIA) (2024-2025) funded by Alder Hey Children's NHS Foundation Trust
- Algorithms for Finding Approximate Nash Equilibria (2013-2016) funded by EPSRC
- Efficiency and Complexity in Congestion Games (2013-2014) funded by EPSRC
