Twenty Lectures on Algorithmic Game Theory

Tim Roughgarden is an Associate Professor of Computer Science at Stanford University, California. For his research in algorithmic game theory, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Game Theory and Computer Science, the Social Choice and Welfare Prize, the Mathematical Programming Society's Tucker Prize, and the EATCS-SIGACT Gödel Prize. He wrote the book Selfish Routing and the Price of Anarchy (2005) and coedited the book Algorithmic Game Theory (2007).

1. Introduction and examples; 2. Mechanism design basics; 3. Myerson's Lemma; 4. Algorithmic mechanism design 34; 5. Revenue-maximizing auctions; 6. Simple near-optimal auctions; 7. Multi-parameter mechanism design; 8. Spectrum auctions; 9. Mechanism design with payment constraints; 10. Kidney exchange and stable matching; 11. Selfish routing and the price of anarchy; 12. Network over-provisioning and atomic selfish routing; 13. Equilibria: definitions, examples, and existence; 14. Robust price-of-anarchy bounds in smooth games; 15. Best-case and strong Nash equilibria; 16. Best-response dynamics; 17. No-regret dynamics; 18. Swap regret and the Minimax theorem; 19. Pure Nash equilibria and PLS-completeness; 20. Mixed Nash equilibria and PPAD-completeness.