Close Menu

CS 539 - Game Theory: Algorithms and Applications

Course Description: 

This course focuses on computational issues in the theory of games, economics, and network design. Interest in the algorithmic aspects of games is motivated by the computational issues of fundamental aspects of games and economic theory, e.g. Nash equilibrium and market equilibrium. Computing and approximating Nash equilibrium will be studied. Of considerable interest to the computer science community are problems that arise from the Internet and computer networks and are similar to issues that arise in traditional transport networks, e.g. Wardrop equilibrium.

Credit: 

(3-0-3)

Prerequisite: 

[(CS 430 with min. grade of C) OR (CS 530 with min. grade of C)]

Corequisite: 

None