CS364A: Algorithmic Game Theory

Instructor: Tim Roughgarden (Office hours: Thursdays 1-2 PM in Gates 462)

Teaching Assistant: Peerapong Dhangwatnotai (Office hours: Tuesdays 3:30-4:30 PM and Wednesdays 2-3 PM in Gates 460 or Gates 463; Email: pdh "at" stanford.edu)

Time/location: 2:15-3:30 PM on Tuesdays and Thursdays in Gates B12.

Course description: Broad survey of topics at the interface of theoretical computer science and game theory such as: algorithmic mechanism design; auctions (efficient, revenue-maximizing, sponsored search, etc.); congestion and potential games; cost sharing; existence, computation, and learning of equilibria; game theory in the Internet; network games; price of anarchy; selfish routing.

Prerequisites: basic algorithms and complexity (154N and 161, or equivalent).

Course requirements: 4 problem sets and a take-home final. Students taking the course for a letter grade should complete all 5 problems on each. Students taking the course for pass/fail should complete the first 3 problems on each. There will also be occasional extra credit problems and opportunities. No late assignments accepted.

Primary references:

Detailed schedule and references (under construction):