6.853 Topics in Algorithmic Game Theory
Presents research topics at the interface of computer science and game theory, with an emphasis on algorithms and computational complexity. Explores the types of game-theoretic tools that are applicable to computer systems, the loss in system performance due to the conflicts of interest of users and administrators, and the design of systems whose performance is robust with respect to conflicts of interest inside the system. Algorithmic focus is on algorithms for equilibria, the complexity of equilibria and fixed points, algorithmic tools in mechanism design, learning in games, and the price of anarchy.
6.853 will not be offered this semester. It will be available in the Spring semester, and will be instructed by K. Daskalakis.
Lecture occurs 11:30 AM to 1:00 PM on Wednesdays and Fridays in 6-120.
This class counts for a total of 12 credits.
You can find more information at the 6.853: Topics in Algorithmic Game Theory, Fall 2011 site or on the 6.853 Stellar site.
© Copyright 2015 Yasyf Mohamedali