CS364B: Topics in Algorithmic Game Theory

Instructors: Tim Roughgarden (Gates 462) and Jason Hartline (Microsoft)

Teaching Assistant: Zoe Abrams.
Office hours: Tuesdays 11:30-1:00 in Gates 466.
Email: zoe"the letter a"@stanford.edu.

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

Course description: In-depth study of three currently active topics on the interface of theoretical computer science and game theory: approximately efficient combinatorial auctions, optimal mechanism design, and the computational complexity of noncooperative equilibria. Can be taken prior to 364A. Can be repeated for credit. Prerequisites: 154N and 161, or equivalent.

Course requirements: For students enrolled pass/fail, the grade will be purely attendance- and participation-based. Students enrolled for a letter grade are expected to complete a major research project.

Research project:

Lecture notes: To be handed out sporadically as the course goes on (and afterwards...).

Schedule and references: