Mechanism Design and 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: Prof. Mohammad T. Hajiaghayi, Office: Brendan Iribe Center, Room 5158

TA's: Iman Gholami (imangholami77@gmail.com ), Mohammad Mahdavi (mahdavi@umd.edu ), Suho Shin (suhoyah@gmail.com)

Classes: TuTh 8:00am - 9:15am, CSI, Room #2117 (all classes will be available via zoom: link)

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.

Important links

• Course agenda

• Lecture notes

• Assignments/Projects

• Reference books:

  • Essentials of Game Theory: A Concise, Multidisciplinary Introduction by Leyton-Brown, Morgan and Claypool Publishers, 2008.

  • Algorithmic Game Theory, edited by Nisan, Roughgarden, Tardos, and Vazirani, Cambridge University Press, 2007.

Office hours

• Instructor: After the class, or preferably by appointment via e-mail

• Iman Gholami: Tue 11:00am - 12:00pm at A.V. Williams Building, Room 4122

• Mohammad Mahdavi: Tue 3:00pm - 4:00pm at A.V. Williams Building, Room 4122

• Suho Shin: Thu 2:00pm - 3:00pm at A.V. Williams Building, Room 4122

Announcements