SF2972 Game Theory, 7.5 university credits, period 3, 2011
People
-
Lecturers: Jörgen Weibull (jorgen.weibull@hhs.se), Mark Voorneveld (mark.voorneveld@hhs.se)
and Jonas Sjöstrand (jonass@kth.se).
-
Examiner:
Boualem Djehiche (boualem@math.kth.se)
Course main content
- Games in normal form:
- Pure and mixed strategies
- Nash equilibrium
- Dominance and rationalizability
- Imperfect information and Bayesian games
- Games in extensive form:
- Pure, mixed, and behavioral strategies, Kuhn's theorem
- Perfect information: Nash equilibrium, subgame perfect equilibrium
- Imperfect information: sequential and perfect Bayesian equilibrium
- Combinatorial game theory:
- Impartial games: nim, nimber, Sprague-Grundy's theorem
- Partizan games: Hackenbush, Conway's abstract theory, surreal numbers
- Computational game theory: minimax method, alpha-beta pruning
Schedule
All lectures begin quarter past, so 15-17 means 15.15-17.00.
Rooms 3733 and 3721 are on floor 7 at the
department of mathematics, KTH. To reach room 3733 you need a code
that will be revealed at the first lecture. If you forget the code,
call Jonas Sjöstrand's cell phone 0762446523 and he will help you out.
| Lecture |
Date |
Time |
Place |
Lecturer |
Contents |
| 1 |
Jan 18 |
15-17 |
3733 |
Jörgen |
classical game theory (lecture notes) |
| 2 |
Jan 19 |
15-17 |
3733 |
Jörgen |
classical game theory(lecture notes) |
| 3 |
Jan 25 |
15-17 |
3733 |
Jonas |
impartial games (lecture notes) |
| 4 |
Jan 27 |
15-17 |
3733 |
Jonas |
ONAG Ch. 7 and 0, pages 71-80 and 3-14 |
| 5 |
Feb 1 |
15-17 |
3733 |
Jonas |
ONAG Ch. 1 and 2, pages 15-18, 23-24 |
| 6 |
Feb 3 |
15-17 |
3733 |
Jonas |
ONAG Ch. 8, pages 81,86-89 |
| 7 |
Feb 8 |
15-17 |
3733 |
Jörgen |
classical game theory (lecture notes) |
| 8 |
Feb 10 |
15-17 |
3733 |
Jörgen |
classical game theory (lecture notes) |
| 9 |
Feb 15 |
10-12 |
3733 |
Mark |
classical game theory (lecture notes) |
| 10 |
Feb 17 |
10-12 |
3721 |
Mark |
classical game theory (lecture notes) |
| 11 |
Feb 24 |
10-12 |
3721 |
Mark |
classical game theory (lecture notes) |
| 12 |
Mar 3 |
15-17 |
3733 |
Jonas |
ONAG Ch. 10, pages 109-112 |
| 13 |
Mar 8 |
15-17 |
3733 |
Jonas |
ONAG Ch. 9, pages 97-108, and Ch. 16, page 205
|
| 14 |
Mar 10 |
15-17 |
3733 |
Jonas |
ONAG Ch.11, pages 122-124 and computational game theory
(lecture notes) |
| 15 |
Mar 15 |
15-17 |
3733 |
Jörgen |
Solutions to PS1 and PS3 |
| Written exam |
Mar 17 |
14.00-19.00 |
E1 |
|
Checklist for the combinatorial part of the exam |
Examination
In addition to the written exam March 17, there will be approximately five
homework sets during the course. The idea is that doing your homework should
prepare you for the written exam. Each homework set is either Pass or Fail,
and if you fail you must work some more until you pass.
To pass the course you must pass all homework sets and the written exam.
The written exam will consist of two parts: part A on classical game theory
and part B on combinatorial game theory. Each part will be scored from 0 to
25 points, so the maximal number of points you can get is 50. Each
passed homework set handed in timely yields 1 bonus point. The bonus points
are added to the points from the written exam and your grade is calculated
as follows:
| points | grade |
| 0-22 | F |
| 23-24 | Fx |
| 25-29 | E |
| 30-34 | D |
| 35-39 | C |
| 40-44 | B |
| 45- | A |
Literature
-
Martin J. Osborne and Ariel Rubinstein, A course in game theory, MIT Press.
Available for free (yet legal) download from
http://theory.economics.utoronto.ca/books/
-
J. H. Conway, On Numbers and Games, A.K. Peters, Ltd., 2001, 2nd ed., (1st Ed., Academic Press, New York, 1976)
-
E. R. Berlekamp, J. H. Conway, R. K. Guy, Winning Ways for Your Mathematical Plays, A.K. Peters, Ltd.,
2001, 2nd ed., Vol. 1-4, (1st ed., Academic Press, New York, 1982).
An electronic version is freely available to KTH students (at KTHB)
Old exams
Old exams are available from the main course page.
Homework
The problem sets are available here.
To Mathematical Statistics
To Mathematical Statistics Courses
|
