CS364A: Algorithmic Game Theory

Instructor: Tim Roughgarden (Gates 462)

Teaching Assistant: Sergei Vassilvitskii. Office hours: Tuesdays 10:30-noon in Gates 464.

Time/location: 1:15-2:30 PM on Tuesdays and Thursdays in Gates B08. (Room will be B12 starting on Thursday 10/7.)

Course description: Broad, graduate-level overview of topics on the interface of theoretical computer science and game theory. Possible topics include: auctions; congestion and potential games; cost sharing; existence and computation of equilibria; game theory in the Internet; mechanism design; network games; price of anarchy; pricing; selfish routing. Minimal overlap with 224M and 324. Prerequisites: 154N and 161, or equivalent.

Course requirements: Two problem sets and a 10-15 page report summarizing 2-3 research papers.

Schedule and references: