Solving Repeated Games

('games') between decision-makers. The basic solution concept of these
games is the Nash-equilibrium.
To date, these equilibria can be computed efficiently (i.e. in
polynomial time) only for certain classes of interactions (like the 2-
player zero-sum case), but not for arbitrary games.
In this talk, we will discuss repeated games - interactions in which the
players are confronted with the same decision situation repeatedly. We
are going to see how concepts like cooperation and punishment offer
interesting possibilities to compute equilibria in these games.
Afterwards, I will present an overview of my diploma thesis, in which
I tried to extend an efficient algorithm for retrieving these equilibria in
the 2-player case. Furthermore, I would like to introduce the software I
implemented during the preparation of this thesis: an Eclipse-based
game theory workbench.