Algorithmic Game Theory
CS60025, Autumn 2025, LTP: 3-0-0
Instructor |
Somindu Chaya Ramanna |
Teaching assistant |
Tadigoppala Sumanth |
Classes |
THUR: 15:00-16:55; FRI: 15:00-15:55 at CSE-108 |
|
Tutorials on Saturdays
|
|
Notices and Announcements
- First class will be held on the 24th of July
- Approval for joining the couse will be based on CGPA. Those who are not familiar with the course prerequisites (mentioned below) are strongly discouraged from joining this course.
Prerequisites
I assume familiarity with probability theory, discrete mathematics and algorithms. These topics will not be covered in the course.
Evaluation Plan (tentative)
Evaluation for this course will be based on
- Class Tests - 20%
- Mid-Semester Examination - 30%
- End Semester Examination - 50%
References
-
Lecture Notes on Algorithmic Game Theory (CS60025) by Palash Dey (available here).
-
Course on Algorithmic Game Theory -- Lecture Notes by Tim Roughgarden (available here).
-
Algorithmic Game Theory, Edited by Nisan, Roughgarden, Tardos and Vazirani, Cambridge University Press, 2007 (available for free from here).
-
Game Theory by Michael Maschler, Eilon Solan, and Shmuel Zamir.
-
Game Theory and Mechanism Design by Y. Narahari (equivalent lecture notes are available here).