game theory; algorithm; Nash equilibrium; evolutionary stable strategy
en
Abstract:
In recent years computers became more and more important in the area of game theory. As a consequence a new field called algorithmic game theory arose, which deals with both the design of efficient algorithms for finding winning strategies and the analysis of the complexity of games. This diploma thesis gives a short introduction to this topic and presents various algorithms for finding Nash equilibria, evolutionary stable strategies and algorithms in cooperative games. A couple of examples illustrate their functioning and a comparison of the algorithms is carried out.
en
Additional information:
Abweichender Titel laut Übersetzung der Verfasserin/des Verfassers Zsfassung in engl. Sprache