| | |
Summary: Algorithmic Game Theory - Approximate Syllabus
CSCI 6963 (Fall 2011)
This course is a broad introduction to the interface of theoretical computer science and game theory, and
focuses especially on game theory in network and computer science applications. We will use the textbook
Algorithmic Game Theory by Nisan, Roughgarden, Tardos, and Vazirani. The exact coverage is subject to
change.
Introduction to Algorithmic Game Theory (Chapter 1)
Quantifying the Inefficiency of Equilibria (Part III: Chapters 17-21)
· Nash Equilibria
· Routing Games and Congestion Games
· Network Formation
· Price of Anarchy and Price of Stability
· Bandwidth Sharing
Algorithmic Aspects of Equilibria (Part I: some of Chapters 2-7)
· Existence and Complexity of Finding Equilibria
· Market Equilibrium
· Correlated Equilibrium
· Graphical Games
Mechanism and Protocol Design (Part II: some of Chapters 9-15)
· Algorithmic Mechanism Design
|
