|
Lecturer(s)
|
-
Calábek Pavel, RNDr. Ph.D.
-
Botur Michal, doc. Mgr. Ph.D.
|
|
Course content
|
1. Basic notions of the game theory, the normal and the extensive form, decompose at vertex game. Finite game with perfect information theorem. 2. Matrix games, saddle point, solving in pure strategies, solving in mixed strategies. 3. Petersburg paradox, axiomatic utility theory. 4. Games with incomplete information (games againist nature). 5. Two-person general-sum games, the equilibrium point, the Pareto optimum. Repeated games, the prisoner's dilema, evolutionarily stable strategies. 6. Two-person cooperative games, the Nash bargaining Problem. 7. Infinite games, application in economy, Bertrand, Cournot and Stackelberg model. 8. n-person games, characteristic function form games, imputations, domination and stable sets, the core, the Shapley value, nucleolus.
|
|
Learning activities and teaching methods
|
|
Lecture, Dialogic Lecture (Discussion, Dialog, Brainstorming)
|
|
Learning outcomes
|
Understand bases of the game theory, orientation in base models.
6. Evaluation Evaluate strategies in everyday problems from the point of view of theory of games.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Oral exam, Didactic Test
Credit: pass a written test . Exam: the student has to understand the subject and be able to prove the principal results.
|
|
Recommended literature
|
-
Maňas M. (1974). Teorie her a optimální rozhodování. P. D. Straffin: Game Theory and Strategy, MAA Washington, 1993. E. Packel: The Mathematics of Games and Gambing, MAA Washington, 1981. . SNTL Praha.
-
Owen G. (2001). Game theory. AP London.
-
Packel E. (1981). The Mathematics of Games and Gambing. MAA Washington.
-
Straffin P. D. (1993). Game Theory and Strategy. MAA Washington.
|