| Lect# | Title & Link | Date | Extra Reading |
| 0 | Course intro: course smorgasbord | Sep. 10 | |
| 1 | Intro to Nash equilibrium | Sep. 15 | Nisan et al. Chapter 1, Dixit & Skeath Chapter 4 |
| 2 | Nash Equilibria: existence vs. computability | Sep. 17 | Dixit & Skeath Chapter 5 for mixed nash equilibria, and here's a nice survey on the PPAD completeness of computing Nash equilibria |
| 3 | Fair Division: Cutting a cake | Sep. 22 | I think chapter 8 here is quite good. Honestly I'd consider all sections relevant, but the protocols we covered came mostly pre-section 8.4. The first few sections are mostly dedicated to definitions of 'fairness', before it even starts describing a single protocol. |
| 4 | Fair Division: Cutting a cake is actually quite hard | Sep. 24 | Stromquist's paper |
| 5 | Fair Division: Indivisible Items and a Little Background on Hardness | Sep. 29 | Chapter 9 from last week's text is reasonable start - but only section 9.4 - 9.6 I'd say. Then I'd move over to chapter 34 of CLRS. Maybe just the first couple sections, and then finish after Thursday. |
| 6 | More on NP-Completeness | Oct. 1 | Finish chapter 34 of CLRS. |
| 7 | Approximation Algorithms for Knapsack | Oct. 6 | CLRS has a nice FPTAS for SubsetSum. If you want to get a headstart for Thursday, here's the paper that we'll be proving the main result from. |
| 8 | A 2/3-MMS protocol for indivisible goods | Oct. 8 | There isn't a much better resource than the actual paper. THe protocol we did is from section 3. |