CMSC474 - Introduction to Computational Game Theory
Course Information
This course presents the fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their complexity. General topics include graph algorithms, and basic algorithm design paradigms (such as divide-and-conquer, dynamic programming and greedy algorithms), lower bounds and NP-completeness.
| Instructor | Section | Day & Time | Location |
|---|---|---|---|
| Mohammad Hajiaghayi | 0101 | MW 2:00pm - 3:15pm | CSI 3117 |
Course Prerequisite(s)
Prerequisite: Minimum grade of C- in CMSC351; and permission of CMNS-Computer Science department. Or must be in the (Computer Science (Doctoral), Computer Science (Master's)) program.
Class Webpage
Hours Per Week
Languages Used
Recommended Prior Experience
Projects, Exams, or other Assessments
Misc Info
Introduction to Game Theory Lecture