Course Code: CS518
Course Name: Algorithmic Game Theory
Prerequisites: NIL
Syllabus: Games and equilibria, two player Zero-Sum Games, proof of Nash Equilibria, complexity of finding Nash equilibria,information, strategies, dynamic and repeated games, bargaining, auctions, market equilibria, algorithmic mechanism design, inefficiency of equilibria, routing games, load balancing games.
Texts: 1. N. Nisan, T. Roughgarden, V. Vazirani and E. Tardos, Algorithmic Game Theory, Cambridge University Press, 2007.
2. E. Rasmusen, Games and Information: An Introduction to Game Theory, 4th Edn., Wiley-Blackwell, 2006.
3. M. J. Osborne and A. Rubinstein, A Course in Gam Theory, The MIT press, 1994.
4. V. Krishna, Auction theory, Elsevier, 2002.
5. K. R. Apt and E. Graedel, Lectures in Game Theory for Computer Scientists, Cambridge University Press, 2011.
6. J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, Princeton Univ. Press, 1944.