Title: Algorithmische Spieltheorie : effiziente Algorithmen zur Bestimmung spieltheoretischer Lösungen
Other Titles: Algorithmic game theory: efficient algorithms for finding solutions in game theory
Language: Deutsch
Authors: Riedl, Markus 
Pecher, Markus 
Qualification level: Diploma
Advisor: Mehlmann, Alexander
Issue Date: 2010
Number of Pages: 115
Qualification level: Diploma
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.
Keywords: Spieltheorie; Algorithmus; Nash-Gleichgewicht; evolutionär stabile Strategie
game theory; algorithm; Nash equilibrium; evolutionary stable strategy
URI: https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-43991
Library ID: AC07808550
Organisation: E105 - Institut für Wirtschaftsmathematik 
Publication Type: Thesis
Appears in Collections:Thesis

Files in this item:

Show full item record

Page view(s)

checked on Feb 18, 2021


checked on Feb 18, 2021

Google ScholarTM


Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.