Date  Topic  Materials  
1/5,1/7  Course at a glance. 
Slides: ppt, pdf. Homework 0 out. Optional: CACM overview article. 

Part 0: Basic techniques from computer science.  
1/7  1/19  Linear programming. (Mixed) integer linear programming. 
Slides: ppt, pdf. Example files: painting.lp, knapsack.lp, knapsack_simple.mod, knapsack.mod, cell.lp, cell.mod, hotdog.mod, sudoku.mod. SLB Appendices A, B. Programming assignment 1 out. Guide to the modeling language. Here are also lecture notes I wrote those for a course on linear and integer programming; if you want to learn more about these topics there may be some useful resources on that course's website. 

1/14 (bonus lecture)  Computational problems. Algorithms. Runtime of algorithms. Easy and hard problems. 
Slides: ppt, pdf. Sorting algorithms spreadsheet. Example files: set_cover.mod, set_cover2.mod, matching.mod. Optional: CACM article on P vs. NP. 

Part 1: Expressive marketplaces.  
1/24  Singleitem auctions. Combinatorial auctions. Bidding languages. Winner determination problem. Variants (reverse auctions, exchanges). 
Slides: ppt, pdf. Note: we are not going in the same order as the book on these topics. The book does mechanism design before getting into auctions. I'm pointing out the chapters that are associated with each topic, but for reading purposes you may prefer following the order of the book for the next few lectures, reading mechanism design (Ch. 10) before auctions (Ch. 11), and singleitem auctions and their analysis before combinatorial auctions. SLB 11.3.111.3.4, 11.4.1. Optional: 11.2, 11.3.5, Conitzer chapter on auctions, Lehmann et al. chapter on winner determination, Sandholm chapter on optimal winner determination. 

Part 2: Game theory.  
Part 3: Mechanism design. 