CS 6120 Algorithmic Game Theory 3.0 Credits
This course uses an algorithmic approach to solve problems that arise at the interface of economics and computer science. After a short introduction to game theory, it focuses on understanding how the incentives of strategic agents may affect these agents’ decisions, and on designing mechanisms aiming to improve the outcomes of the interactions among the agents. Topics covered include the design of auctions, matching markets, online advertising markets, the fair allocation of resources, selfish routing games, computational social choice, and preference aggregation.
Repeat Status: Not repeatable for credit
Prerequisites: CS 5110 [Min Grade: D] or CS 521 [Min Grade: D]