CS 6840 - Algorithmic Game Theory

General Information

Algorithmic Game Theory is basically what happens when CS people get involved in economics. It combines the assumptions of economics with the “let’s make things tractable” attitude of CS.

Prerequisites

Topics Covered

  • Nash equilibrium
  • Congestion games
  • Price of anarchy and price of stability
  • Potential games
  • Learning in games
  • Auction Theory
  • Complexity of finding equilibria

Workload

Four problem sets, final project, and take home final. The problem sets are done collaboratively, but are generally quite difficult and time consuming.

General Advice

Start on the problem sets early, and discuss them with other students. They can be quite challenging, and having more people allows you to get multiple perspectives and ideas out.

In Spring 2012, there wasn’t a whole lot of time to work on the project, between the earlier problem sets and the take home final. You might want to start on the project much earlier (i.e., during the middle of the semester).

Testimonials

Past Offerings

Semester Time Professor Median Grade Course Page
Spring 2012 - Eva Tardos - http://www.cs.cornell.edu/courses/cs6840/2012sp/

Resources

Edit this page on Github: classes/CS6840.md

Edit me on GitHub