Fandom

Cornell Computer Science Wikia

CS 6840 - Algorithmic Game Theory

70pages on
this wiki
Add New Page
Comments0 Share

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.

General Information Edit

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 Edit

CS 4820

Topics Covered Edit

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

Workload Edit

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 Edit

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 Edit

Past Offerings Edit

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


Resources Edit

Also on Fandom

Random Wiki