The notes on this page were initially written for myself to refer to while tutoring. I have found them helpful in preparing for the course, and therefore posted them in the off chance case others find it helpful . For the first set of notes, there is a large degree of overlap between these notes and the excellent textbook by Maschler, Solan and Zamir. For the second half the course, the notes have a strong overlap with Tim Roughgarden’s lecture notes. These notes are not a replacement for the lecture notes provided by the Professor teaching the course. The notes may have errors, and will almost certainly contain typos.
Supplementary material for Tutorial 1: Notes on Preferences, Utilities, and Decisions
Supplementary material for Tutorial 2: These notes formally introduce strategic form games and the ideas of domination, stability and maxmin strategies Notes (In Progress)
Supplementary material for Tutorial 3: Extensive form games with imperfect information, behavioural actions and repeated games Notes (In Progress)
Supplementary Material For Routing/Congestion Games: Lecture 11 introduces the concept of Price of Anarchy (POA). Then they go on to show that in order to understand the worst case outcome of selfish behaviour for a given cost function class \mathcal{C} for any network, it suffices to analyse a very simple network (the pigou network) with the same cost class. Lecture 12 introduces atomic games and shows that if we consider affine cost functions, then the POA is upper bounded by \frac{5}{3}. Lecture 13 introduces the idea of potential games and how to check if equillibria exists. Lecture 14 generalises the proof techniques for upper bounding POA, by introducing the idea of smooth games.