Teaching

• COMP211: Computer Networks

Short Bio

I received a Diplom in Communication Engineering in 2000, from the University of Applied Sciences Esslingen. After working as a developing engineer for 5 months at a startup company, I went to Clemson University, where I received my M.Sc. in Computer Science in 2001. I then went to Paderborn, Germany where I was a member of Burkhard Monien's research group. There I received my Ph.D. (more exactly my Dr. rer. nat) in 2006 with summa cum laude. From September 2007 to August 2009, I was a postoctoral researcher in the group of Richard Karp at the International Computer Science Institute (ICSI) in Berkeley. In September 2009, I joined the Economics and Computation Group at the University of Liverpool. My research focuses on Algorithmic Game Theory.

Conferences & Workshops

• SAGT 2009, PC member.
• WINE 2009, PC member.

Selected Publications

For a more complete list see: DBLP, Google Scholar

• Covering Games: Approximation Through Non-Cooperation pdf

  Martin Gairing.
  Proc. of the 5th Workshop on Internet and Network Economics (WINE 2009), LNCS 5929, pp. 184-195, 2009.

• Quasirandom Load Balancing pdf

  Tobias Friedrich, Martin Gairing, Thomas Sauerwald.
  Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 1620-1629, 2010.

• Exact Price of Anarchy for Polynomial Congestion Games pdf

  Sebastian Aland , Dominic Dumrauf , Martin Gairing , Burkhard Monien , Florian Schoppmann.
  Proc. of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006), LNCS 3884, 218-229, 2006.

• Malicious Bayesian Congestion Games pdf

  Martin Gairing.
  Proc. of the 6th Workshop on Approximation and Online Algorithms (WAOA 2008), LNCS 5426, pp. 119-132, 2009.

• Selfish Routing with Incomplete Information pdf

  Martin Gairing , Burkhard Monien , Karsten Tiemann.
  Theory of Computing Systems, 42(1), 91-130, 2008.