Game theory techniques in computer science
Notes de cours
- Optimal memoryless strategies. This paper corresponds more or less to the first course, the notation may be different.
- Strategic-form games and Nash equilibria. These notes contain all what I have done during the last three courses, with additional examples and exercises.
- Games in extensive form.
- Mechanism design. The last part of the notes about mechanism design (Bayesian mechanism design) was not treated in the course and will not be treated in the exam. Still you can read it, but it is not mandatory.