COL866: Special Topics in Algorithms - Algorithmic Game Theory |
|||||||||||||||||||||||||||||||||||||||||||||
Announcements | Please
register yourself on Piazza by clicking here.
Use course number as signup code. |
||||||||||||||||||||||||||||||||||||||||||||
Lectures | Lectures will be held from 3 to 4:30pm in 501 Bharti on the dates specified below. The first 10 lectures will be discussion sessions where we will clarify any doubts you may have on the corresponding videos. It is therefore very important that you complete the reading and viewing assignment before coming to the lecture. | ||||||||||||||||||||||||||||||||||||||||||||
Tentative Lecture outline with topics |
|
||||||||||||||||||||||||||||||||||||||||||||
Reading material |
[1] Lecture
Notes by Tim Roughgarden [2] Algorithmic Game Theory, by Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani (eds.), Cambridge University Press, September 2007. [3] Linear Programming Duality |
||||||||||||||||||||||||||||||||||||||||||||
Assignments | Assignments are to be done individually. Any help taken from outside sources (websites, books) should be clearly mentioned. | ||||||||||||||||||||||||||||||||||||||||||||
Evaluation | Assignments (5,
each of 6 marks), Midterm (30 marks), Major (40 marks) |
||||||||||||||||||||||||||||||||||||||||||||
Attendance Policy | Attendance is compulsory in the lectures. |