Slides from each lecture will be posted on this page as the course progresses.
Date Topic Slides Recordings (S = Stream, M = MyMedia) Reading
(Parkes-Seuken Book)
9/13 Course introduction; Game Theory 1: Normal form games; Dominant strategies Syllabus
Slides		 S | M Chapter 2 up to Section 2.4
9/20 Game Theory 2: Nash equilibria, Nash's theorem, the indifference principle Slides S | M Chapter 2 up to Section 2.4, Chapter 26 up to Section 26.1
9/27 Game Theory 3: More indifference principle, price of anarchy (PoA), price of stability (PoS), cost-sharing games Slides S | M Chapter 1 - Section 1.1; Chapter 2 - Section 2.6.1;
10/04 Game Theory 3: Price of stability in cost-sharing games, potential functions, congestion games, Braess' paradox, zero-sum games, Stackelberg games Slides S | M Chapter 2 - Section 2.6.1; Chapter 3 - Section 3.1; Note by Vincent Conitzer
10/11 Game Theory 4: End Stackelberg games; Mechanism Design with Money 1: VCG mechanism Slides S | M Chapter 6 up to Section 6.3; Chapter 7 up to Section 7.3
10/18 Mechanism Design with Money 2: More VCG examples; truthful greedy approximation of VCG Slides S | M Chapter 8 up to Section 8.2
10/25 Mechanism Design w/ Money 3: Sponsored search; Bayes-Nash equilibria Slides S | M Chapter 10 up to Section 10.5; Chapter 6 - Sections 6.3, 6.4, 6.5
11/01, 11/08 NO CLASS -- -- --
11/15 Fair Division: Cake-cutting Slides S | M Chapter 13 up to Section 13.4 from Handbook of Computational Social Choice
11/22 Voting: Introduction, Rules, Gibbard-Satterthwaite Theorem, Approaches to voting: axiomatic, statistical, implicit utilitarian Slides S | M Chapter 7 - Section 7.6.2; Chapter 14 up to Section 14.1.4; Also, Chapter 2 up to Section 2.8 from Handbook of Computational Social Choice
11/29 Mechanism Design w/ Money 1: Stable Matching, Facility Location Slides S | M Chapter 12 up to Section 12.2; Paper
12/06 Review N/A S | M N/A