Algorithmic Game Theory (Fall 2013) by Tim Roughgarden at Stanford U

# click the upper-left icon to select videos from the playlist

source: Tim Roughgarden Lectures     2013年9月25日
Algorithmic Game Theory (CS364A, Fall 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.

Lecture 1 (Introduction) 1:09:24
Lecture 2 (Mechanism Design Basics) 1:12:02
Lecture 3 (Myerson's Lemma) 1:17:08
Lecture 4 (Algorithmic Mechanism Design) 1:16:00
Lecture 5 (Revenue-Maximizing Auctions) 1:18:06
Lecture 6 (Simple Near-Optimal Auctions) 1:14:31
Lecture 7 (VCG Mechanism) 1:16:56
Lecture 8 (Spectrum Auctions) 1:17:08
Lecture 9 (Beyond Quasi-Linearity) 1:17:31
Lecture 10 (Kidney Exchange, Stable Matching) 1:16:03
Lecture 11 (Selfish Routing and the POA) 1:20:55
Lecture 12 (Network Over-Provisioning) 1:18:16
Lecture 13 (Hierarchy of Equilibrium Concepts) 1:11:03
Lecture 14 (Smooth Games) 1:13:27
Lecture 15 (Best-Case and Strong Nash Equilibria) 1:15:21
Lecture 16 (Best Response Dynamics) 1:20:49
Lecture 17 (No-Regret Dynamics) 1:16:37
Lecture 18 (Swap Regret; Minimax) 1:14:51
Lecture 19 (Pure NE and PLS-Completeness) 1:12:59
Lecture 20 (Mixed NE and PPAD-Completeness) 1:14:02