Games and Decisions

Home assignment

Your homework will consist of five problems, worth 10 points each. The assignment will be posted here around the 9th week of the semester.

Lecture presentations

Lecture 1: Introduction.
Lecture 2: Matrix games.
Lecture 3: Mixed strategies.
Lecture 4: Mixed strategies (cont'd). Bimatrix games.
Lecture 5: Auctions.
Lecture 6: Oligopoly.
Lecture 7: Collusive oligopoly (cont'd). Coalition games.
Lecture 8: Nash equilibria in complicated games. Risk & uncertainty.
Lecture 9: Risk & uncertainty (cont'd). Utility theory. p-intelligent players.
Lecture 10: Games in extensive form.
Lecture 11: Games in extensive form (cont'd). Bargaining games.

Note: these are (slightly modified) presentations from last semester, some of them may still get modified in the course of the semester. Be that as it may, the presentations posted here now should cover all the topics needed for the final exam.

Other materials

a spreadsheet file with a tutorial showing how to use MS Excel Solver to find a mixed-strategy NE in a matrix game
a spreadsheet file that uses MS Excel Solver to find a mixed-strategy NE in an auction (modelled as a bimatrix game)
a zipped folder with Matlab scripts that find a NE in complicated oligopolies and auctions using the fictitious game method

Course requirements

50 points: assignments (5 problems, 10 points each, see above)
50 points: final exam

Grading scale

90 – 100 points: excellent (1)
75 – 89 points: very good (2)
60 – 74 points: good (3)
0 – 59 points: failed (4)