Introduction to Computational Game Theory
CMSC474 — Spring 2019
Department of Computer Science, University of Maryland
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: 2113 A.V. Williams
Classes: TuTh 2:00pm - 3:15pm, CSI, Room #3118
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
- Lecture notes
- 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.
- Instructor: Tue 5PM-6PM at A.V. Williams Bldg., Room 2113, or preferably by appointment via e-mail.
- Saeed Seddighin: Wed 9:00AM-11:00AM at A.V. Williams Bldg., Room 4101/4103
- Joon Kim: Mon 10:00AM-12:00PM at A.V. Williams Bldg., Room 4101/4103
- Project 1 is posted.
- Homework 1 is posted, the due date is Feb 26th at the beginning of the class.