CS364A: Algorithmic Game Theory (Fall 2013)

Instructor: Tim Roughgarden (Office hours: Mondays and Wednesdays after class.)

Teaching Assistants:

Time/location: 2:15-3:30 PM on Mondays and Wednesdays in Littlefield 103.

Piazza site: here

Course description: Broad survey of topics at the interface of theoretical computer science and economics. Introduction to auction and mechanism design, with an emphasis on computational efficiency and robustness. Introduction to the "price of anarchy", with applications to networks. Algorithms and complexity theory for learning and computing Nash and market equilibria. Case studies in Web search auctions, wireless spectrum auctions, matching markets, network routing, and security applications.

Prerequisites: basic algorithms and complexity (154N and 161, or equivalent). No prior knowledge of economics or game theory is required.

Course requirements: All students are required to complete weekly exercise sets, which fill in details from lecture. Students taking the course for a letter grade are also required to complete biweekly problem sets, which supplement the material covered in lecture. Students are encouraged to form groups (up to three students) to complete the problem sets. There will also be occasional extra credit problems and opportunities. No late assignments accepted.

All lecture notes and exercise sets in one PDF.

Lecture videos and notes (beta versions)

Exercise and problem sets:

Primary references:

Detailed schedule and references: