CSCE 489/689: Special Topics in Algorithmic Game Theory

Fall 2013

As our world becomes increasingly connected, the mutual effect we have on each other's decisions and actions is ever more pronounced. Game Theory models the strategic interaction of multiple people (players, agents or users of a system). Algorithmic Game Theory merges computation with economic reasoning in order to better understand and improve the strategic interaction that occurs in the complex systems that surround us: the Internet, telecommunication and transportation networks, social networks, online markets, etc.

This class will provide an introduction to Algorithmic Game Theory, as well as survey state-of-art research in the field. Sample topics include: Strategic Form Games (Matrix and continuous games. Nash Equilibrium, Mixed and correlated equilibrium. Supermodular games. Potential/congestion games.); Learning, Evolution, and Computation; Extensive Games with Perfect Information (Subgame Perfect Equilibrium, Bargaining games); Repeated Games; Games with Incomplete Information; Mechanism Design and Auction Theory; Network Effects and Games over Networks; Price of Anarchy; Matchings; Social Networks.


Course Information

Course Outline

There is a significant dynamic component to the course, as topics drop in and out, or get longer or shorter treatment, depending on audience interest/reaction/resistence. Given this, here is a rough outline of the course material:


Online Resources

LaTeX: Feel free to use the following template for writing your assignments in LaTeX. The template contains commands for Theorem, Lemma, Corollary, Proposition, Claim, Definition, Construction, Remark etc. An example file where this template is used is here which results in the following pdf.

Background material: Some classes with overlapping topics at other universities: