This is a short (21 hours) course of 6/7 Lectures. This course is an introduction to game theory and its algorithmic aspects. Ideas such as dominance, backward induction, Nash equilibrium, evolutionary stability, commitment, credibility, asymmetric information, adverse selection, and signaling are discussed and applied to games played in class and to examples drawn from economics, politics and computer science in general.
The lectures and homework may involve the analysis of algorithms at a fairly mathematical level: students are expected to be comfortable reading and writing proofs
The material presented during class is used by students as a complementary text book. Lecture notes and slides are mainly based on the amazing course on game theory given by Dr. Ph.D. Ben Polak, Professor of Economics and Management, Yale University which can be found [here].