Applied Game Theory

Prof. Pietro Michiardi

Networking and Security Deptartment
Institut Eurecom, 2229, route des Cretes,
BP 193, F-06560 Sophia-Antipolis (FRANCE)
Tel: +33.(0)4.93.00.81.45
FAX: +33.(0)4.93.00.82.00

[Link to Home Page]

Course Description

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

Prerequisites:

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

Comment on the lecture notes:

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].

Course Contents

Introduction
Iterative deletion of dominated strategies
Best response strategies
Nash equilibrium
Mixed strategies
Evolutionary stability
Sequential games
Backward induction
Imperfect information
Subgame perfect equilibrium
Repeated games
Asymmetric information

Lecture Notes

[Work in progress:: subsequent lecture notes are currently being prepared]