Game Theory
Keywords |
Classification |
Keyword |
OFICIAL |
Mathematics |
Instance: 2015/2016 - 2S
Cycles of Study/Courses
Teaching language
Portuguese
Objectives
Introduction to Game Theory and its applications.
Learning outcomes and competences
To acquire knowledge on the theory of impartial combinatorial games, as well as on the classical game theory with applications to economics.
Working method
Presencial
Program
Impartial combinatorial games. Decidibility, equivalence relation, mex rule, representation by digraphs. Sprague-Grundy function. Misère Nim.
Static games of complete information. Normal form. Nash equilibrium. Mixed and pure strategies. Bertrand duopoly. Final offer arbitration. The problem of the commons. Social optimum. Nash theorem.
Dynamic games of complete information. Extensive form. Subgame perfect Nash equilibrium. Stackelberg duopoly. Graphical analysis of Nash equilibria. Repeated games. Stationary strategies and stationary Nash equilibrium of a repeated game. Infinitely repeated games. Subgame perfect Nash equilibrium for infinitely repeated games. Friedman's theorem.
Mandatory literature
Gibbons Robert;
A primer in game theory. ISBN: 0-7450-1159-4
Siegel Aaron N. 1977-;
Combinatorial game theory. ISBN: 9780821851906
Ferguson Thomas; http://www.math.ucla.edu/~tom/Game_Theory/Contents.html
Teaching methods and learning activities
Lectures and classes: The contents of the syllabus are presented in the lectures, illustrated with several examples. In the practical classes, exercises and related problems are solved and discussed.Evaluation Type
Distributed evaluation with final exam
Assessment Components
designation |
Weight (%) |
Exame |
60,00 |
Trabalho escrito |
40,00 |
Total: |
100,00 |
Calculation formula of final grade
The final grade will be obtained by the weighted average of 60% of the exam grade and 40% of the homework grade.