CPSC 091.1. Special Topics: Algorithmic Game Theory

How much of traffic congestion is due to drivers behaving selfishly? How can an auction be set up to allocate goods most efficiently? This course will take an algorithmic approach to designing and analyzing strategic environments, where autonomous and self-interested people (or computers) interact. Topics will include best-response dynamics, routing games, the price of anarchy, regret-minimizing algorithms, truthful mechanisms, and combinatorial auctions.
Prerequisite: CPSC035 required. Mathematics background at the level of Linear Alegebra or higher is required.
Natural science.
Lab work required.
1 credit.
Catalog chapter: Computer Science
Department website: http://www.swarthmore.edu/computer-science

Access the class schedule to search for sections.

Close Window