Difference between revisions of "CMSC474 - Introduction to Computational Game Theory"

From CS 400 Level Course Wiki
 
Line 1: Line 1:
 
'''Course Information''' <br>
 
'''Course Information''' <br>
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.
+
Game theory deals with interactions among agents (either human or computerized) whose objectives and preferences may differ from the objectives and preferences of the other agents. It will also provide a comprehensive introduction to game theory, concentrating on its computational aspects.
  
 
{| style="text-align:left; width: 550PX;"
 
{| style="text-align:left; width: 550PX;"

Latest revision as of 17:37, 12 April 2017

Course Information
Game theory deals with interactions among agents (either human or computerized) whose objectives and preferences may differ from the objectives and preferences of the other agents. It will also provide a comprehensive introduction to game theory, concentrating on its computational aspects.

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