Search Results

CS 618 Algorithmic Game Theory 3.0 Credits

This course explores, from an algorithmic perspective, problems that arise at the interface of economics and computer science. After a short introduction to game theory, the focus will be 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. The topics covered include the design of auctions, matching markets, online advertising markets, fair division, selfish routing, social choice, and preference aggregation.

College/Department: College of Computing and Informatics
Repeat Status: Not repeatable for credit
Prerequisites: CS 521 [Min Grade: C] or CS 522 [Min Grade: C]