| |
CSL863: Special Topics in
Theoretical Computer Science - Algorithmic Game Theory
|
| Announcements |
Click here to see
your marks in the midterm/assignments.
The Major exam will be held in Room 501 (Bharti Building) from 8am
onwards. During the exam you can refer to the reading material given below
as well as you class notes. |
| Tentative Lecture outline
with topics |
| Topics |
Date |
Reading material |
| Introduction to Algorithmic
Game Theory |
July 26 |
Slides |
| Definitions of Games and
Equilibria; Two player Zero-Sum Games; Proof of Nash Equilibria
using Linear Programming Duality. |
July 27, 29 |
Notes |
| Load Balancing Games |
August 2,4,5,9 |
Notes1,
Notes2,
Notes3 |
| Potential function games |
August 10 |
Notes1 |
| Price of Anarchy in network
routing games |
August 12, 17, 19, 23 |
Notes1,
Notes2,
Notes3,
Notes4 |
| Discrete Routing Games |
August 24, 26 |
Notes1 |
| Combinatorial Auctions |
August 30, Sept 6, 7, 9 |
Notes1 |
| Arrow's and
Gibbard-Satherthwaite thms |
Sept 13, 14, 16, 20, 21, 23 |
Chapter 9 of Nisan et.al. |
| Optimal Mechanism Design |
Oct 11, 12, 14, 18 |
Notes |
|
|
Supplementary
reading materials |
Algorithmic
Game Theory, by Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V.
Vazirani (eds.), Cambridge University Press, September 2007.
Linear Programming Duality
|
| Assignments |
Assignments are to be done
individually. Any help taken from outside sources (websites, books) should
be clearly mentioned. |
| Evaluation |
Assignments (3, each of 10
marks), Midterm (25 marks), Major (40 marks), Lecture Quiz (5 marks) |
| Attendance Policy |
Attendance is compulsory in
the lectures. |