Introduction to Algorithmic Economics
SS/CS 149
Fall 2013
Monday/Wednesday 10:30am - 11:55am
213 Annenberg
Instructor
Katrina Ligett, 316 Annenberg. Office hours by request.
Description
This course will equip students to engage with current topics of
active research at the intersection of social and information
sciences, including: algorithmic mechanism design; auctions; existence
and computation of equilibria; and learning and games.
Prerequisites
For those with a CS background, Ma 3, CS 24, and CS 38, or instructor permission. For those with other backgrounds, please consult with the instructor. I expect there will be mixed backgrounds in the class.
Reference
No textbook is required. One text you may find useful is
Nisan, Roughgarden, Tardos, and Vazirani (eds), Algorithmic Game Theory, Cambridge University, 2007.
The book is available for free here (username=agt1user, password=camb2agt).
Evaluation
Your grade in the course will be based on
- participation (including surveys, evaluations, self-evaluations) (20%)
- teaching a portion of one lecture (25%)
- a reaction paper (20%) and final presentation on it (10%) and
- two homework assignments (25%).
Resources from similar courses
This course's design, content, and website are based in part on similar courses here at Caltech and at other schools:
- Caltech, (CS101A, a previous iteration of the present course) Special topics at the Intersection of Social and Information Sciences, Katrina Ligett
- Caltech, (CS/SS 241a) Introduction to SISL:
Topics in Algorithmic game theory, Adam Wierman, John Ledyard, and Jason Marden
- MIT, Topics in Algorithmic Game Theory, Costis Daskalakis
- Stanford, Algorithmic Game Theory, Tim Roughgarden
- Cornell, Algorithmic Game Theory, Éva Tardos
- Cornell, The Structure of Information Networks, Jon Kleinberg