✳flâneur — a map of the web's best reading

Algorithmic Game Theory (CS364A), Fall 2013

timroughgarden.org · 2,104 words · saved by 1 readers

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.

Algorithmic Game Theory (CS364A), Fall 2013 CS364A: Algorithmic Game Theory (Fall 2013) Instructor: Tim Roughgarden (Office hours: Mondays and Wednesdays after class.) Teaching Assistants: Kostas Kollias (Office hours: Thursdays 9 AM-Noon, in Gates B24A. Email: kkollias "at" stanford.edu) Okke Schrijvers (Office hours: Tuesdays 1-4 PM, in Gates 463A. Email: okkes "at" stanford.edu) 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

Explore this link on the map →

saved by

related reading