Bibliographic Metadata

Title
Algorithmische Spieltheorie : effiziente Algorithmen zur Bestimmung spieltheoretischer Lösungen / von Markus Pecher und Markus Riedl
Additional Titles
Algorithmic game theory: efficient algorithms for finding solutions in game theory
AuthorRiedl, Markus ; Pecher, Markus
CensorMehlmann, Alexander
Published2010
Description115 S. : Ill., graph. Darst.
Institutional NoteWien, Techn. Univ., Dipl.-Arb., 2010
Annotation
Abweichender Titel laut Übersetzung der Verfasserin/des Verfassers
Zsfassung in engl. Sprache
LanguageGerman
Document typeThesis (Diplom)
Keywords (DE)Spieltheorie / Algorithmus / Nash-Gleichgewicht / evolutionär stabile Strategie
Keywords (EN)game theory / algorithm / Nash equilibrium / evolutionary stable strategy
URNurn:nbn:at:at-ubtuw:1-43991 Persistent Identifier (URN)
Restriction-Information
 The work is publicly available
Files
Algorithmische Spieltheorie [2.11 mb]
Links
Reference
Classification
Abstract (English)

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.

Stats
The PDF-Document has been downloaded 38 times.