Home > Research Groups > Algorithms and Complexity > Algorithmic Game Theory Group

Algorithmic Game Theory Group

In many relevant problems - e.g. in large decentralized networks - the question of resolution through a central authority is no longer the focal point, but the distributed resolution through a multitude of actors. Here, actors chose their strategies according to their egoistic interests, which may lead to resolutions, worse than those from a central authority.

On the one hand, we investigate how much the actor's strategic actions influence the resolution's quality. On the other hand, we are interested in forecasting, to which resolutions strategic actions may lead.

Learn more about our research topics here!

News and Events

  • "Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource" was accepted at SPAA 2017.
  • "Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App" was accepted at DESRIST 2017.
  • "Congestion Games with Complementarities" accepted at CIAC 2017.
  • "On Scheduling with a Sharable Resource" accepted at MAPSP 2017.
  • Max Drees successfully passed his doctoral examination. Congratulations.
  • We were awarded the Förderpreise für „Innovation und Qualität in der Lehre" (Price for Innovation and Quality in Teaching) for our Project StudyNow.

People

  • Jerome Kempf
  • Arne Kemper
  • Jan Bürmann
  • Vipin Ravindran Vijayalakshmi

Associated members

Teaching

If you are interested in particpating in our research by writing your Bachelor's or Master's thesis on algoritmic game theory, just contact one of us and drop by for a cup of coffee or tea. Some examples for topics can be found here.

For our lectures and seminar see here for more information.

Working

We are always looking for motivated students who want to support us in our research as student assistants. A good understanding of algorithms and a strong interest in theoretical computer science should be present, but we also have more applied tasks like programming and simulating of algorithms. Just contact one of us and drop by for a cup of coffee or tea.

Projects

Past Visitors

  • John Augustine, IIT Madras
  • John Jacobs, University of Rochester
  • Grammateia Kotsialou, University of Liverpool
  • Daniel Schmand, RWTH Aachen
  • Menghsuan Sam Pan, Massachusetts Institute of Technology
  • Kacper Wardega, The Ohio State University
  • Angelo Fannelli, CNRS France
  • Martin Gairing, University of Liverpool
  • Sascha Geulen, RWTH Aachen
  • Azam Ramezanipour, Bu-Ali Sina University, Hamedan, Iran