Mechanism Design in particular Algorithmic Game Theory, which can be viewed as ``incentive-aware algorithm design'', has become an increasingly important part of computer science in recent years. In this course, we review the basics of game theory and algorithmic game theory and we consider several game theoretic scenarios in the class.
Instructor: Mohammad T. HajiAghayi, Office: 3249 A.V. Williams
TA's: Saeed Seddighin (saeedreza.seddighin@gmail.com) and Joon Kim (dongjoon999@gmail.com)
Classes: MW 2:00pm - 3:15pm, CSI, Room #3117
Requirement: Minimum grade of C+ in CMSC351 is strongly recommended. If you are unsure of whether you have sufficient background for this course or not, please contact the instructor in the first week of the class or before.
Course agenda: [pdf]
Reference books:
Office hours
Homework:
Projects:
Exams
Class Topics
Further Topics (as reading assignments):
Other Resources (from here)
Tips for good technical writing
Tips for effective presentation