CS294:  Game Theory and the Internet

Instructor:  Christos H. Papadimitriou 
Soda 689,  mailto: christos@cs.berkeley.edu, (510) 642-1559
Tim Roughgarden, Scott Shenker , and Tom Marschak have promised to participate.

Office Hours:  Tuesdays and Thursdays 5-6pm, and by appointment

Meets:  Monday-Wednesday 9:30-10:30 am, in Soda 310.
 Also, try to keep Friday 9:30-10:30 open for occasional make-up meetings.

Course  Format:  Lectures by the instructor in the beginning, soon mostly by students.

Course Requirements:

Lectures and Notes
(Scribes:  Consider using
this latex style)

Tuesday August 26:  Introduction 

Wednesday, August 27:  Existence of Nash equilibria

Wednesday, Sept 3:  Complexity of Nash equilibria

Monday, Sept 8:  Correlated equilibria

Wednesday, Sept. 10:  Some other equilibrium concepts

Monday, Sept 15:  The price of anarchy in routing (Tim Roughgarden)

Wednesday, Sept. 10:  Congestion Games I:  potential functions

Monday, Sept 22:  Congestion Games II:  PLS (draft)

Wednesday, Sept. 24:   Congestion Games III:  subjective delays

Monday, September 29:  Congestion Games IV:  Wrap-up and Routing

Wednesday Oct 1:   Network routing and market equilibria (draft)

Monday October 4:  Krishnendu Chatterjee on Stochastics Games; and his slides

Wednesday, October 6:  Mechanism design basics

Wednesday, Oct 15  Quasilinear environents (cont.)

Wednesday October 17:  Ahuva Mu'alem on the uniqueness of VCG (with Lavi and Nisan)

Wednesday October 22:  Shortest path auctions

Monday October 27:  Combinatorial auctions, complexity

Wednesday October 29:  Nash implementation

Monday November 3:  Brian Milch on automatic mechanism design

Wednesday November 5:  Bayesian games

Michal Friedman on free-riding in P2P systems

Byung-Gon Chun on the caching game

Kevin Lacker on Truthfulness and Approximation

December 1:  Mark Pearson on  Non-Cooperative Computation




Problem Sets

First problem set, due September 29

Topics and Readings

See Tim's list

Similar Courses

By Noam Nisan, Mike Kearns, my own previous course, Bernhard von Stengel's, and a tutorial I gave once.