Lecturer(s)
|
-
Blábol Petr, prof. RNDr. Ph.D.
|
Course content
|
Week 1: basic notations, motivation and examples Week 2-3: normal forms and extensive forms, dominated and dominating strategies Week 4-5: Nash theorem, proof, significance and determination of Nash equilibria Week 6-7: one-shot games and repeated games Week 8-9: complete and incomplete information Week 10-11: cooperative and non-cooperative games Week 12-13: mechanism design, incentives, brinkmanship and applications
|
Learning activities and teaching methods
|
Interactive lecture, Lecture supplemented with a discussion, Lecture with practical applications, Task-based study method
- Preparation for an examination (30-60)
- 40 hours per semester
- Contact hours
- 39 hours per semester
- Individual project (40)
- 25 hours per semester
|
prerequisite |
---|
Knowledge |
---|
This course assumes the knowledge of mathematical analysis within the range of KMA/M2 or KMA/MA2. |
learning outcomes |
---|
The student will be able to construct and analyze simple models with interactions. Basic tools include combinations of simple methods from analysis, probability theory and algebra. |
teaching methods |
---|
Lecture supplemented with a discussion |
Interactive lecture |
Task-based study method |
assessment methods |
---|
Project |
Recommended literature
|
-
Dixit, Avinash K.; Nalebuff, Barry J. Thinking strategically: The competitive edge in business, politics, and everyday life. W. W. Norton & Company, 1993. ISBN 0-393-31035-3.
-
Fudenberg, Drew; Tirole, Jean. Game theory. MIT Press, 1991. ISBN 978-0-262-06141-4.
-
Myerson, Roger B. Game theory : analysis of conflict. Cambridge : Harvard University Press, 1991. ISBN 0-674-34116-3.
|