Algorithmic Game Theory, Lecture 1 (Introduction)
Kei Kreutler
Info

Lecture 1 of Tim Roughgarden's Algorithmic Game Theory class at Stanford (Autumn 2013) Class description: Topics at the interface of computer science and game theory such as: algorithmic mechanism design; combinatorial auctions; computation of Nash equilibria and relevant complexity theory; congestion and potential games; cost sharing; game theory and the Internet; matching markets; network formation; online learning algorithms; price of anarchy; prior-free auctions; selfish routing; sponsored search.

Connections