Course Description

55923: Computational Topics in Game Theory

Place and Time

Elath hall, Feldman building (Givat-Ram) — Sundays 12-14 — Fall 2010/11 (תשע”א)

Instructor

Michal Feldman.

Course Text

The course will be based to a large extent on the book Algorithmic Game Theory (online version).

Syllabus (tentative)

  • Introduction: Games and CS
  • Pure Nash Equilibria
  • Potential Games and Congestion Games
  • Price of Anarchy and of Stability
  • Network creation games and Scheduling Games
  • Coalitions and strong equilibria
  • game-tree evaluation and alpha-beta pruning
  • Mixed Nash equilibrium
  • Nash’s Theorem, Brouwer Fixed point Theorem
  • Social choice theory (Arrow and Gibbard-Satterthwaite theorems, stable matching)
  • Auctions, Mechanisms, and Incentive-Compatibility
  • Combinatorial auctions

Course Requirements

  • Attend (essentially) all classes
  • Solve all homework exercises (there will be 3-4 problem sets during the semester)

Grader

Tali Gutman

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: