Perfect information games: From determinacy to subgame perfection

A graduate level minicourse in fall 2019 (contact learning dates and places in the text)
Course code and extent: 802651S, 3 ECTS

The course is intended for a broad audience of students in mathematical sciences, computer science and economics. It serves as an introduction to perfect information games.

Organization of the course. 4 Lectures. Tutorials. The course is completed by submitting solutions to selected exercise problems by the end of October.

Schedule

Lectures:

  1. Mon 16.9 10-12 (TM 107)
  2. Mon 16.9 12-14 (TM 107)
  3. Tue 17.9 10-12 (TM 109)
  4. Tue 17.9 14-16 (TM 109)

Tutorials/Consultation: Fri 20.9 (TBA)

Visiting lecturers

  • Janos Flesch, University of Maastricht, School of Business and Economics.
  • Arkadi Predtetchinski, University of Maastricht, School of Business and Economics.

Abstract 
Perfect information games have become an important analytical tool in a number of different disciplines, including descriptive set theory, logic, computer science, and economics. This short course offers an introduction to some mathematical aspects of the theory of perfect information games. We start with a discussion of determinacy, centering around Martin’s landmark result on determinacy of Borel games. We then proceed to introduce n-player perfect information games. In this setup, we will discuss the existence of epsilon-Nash equilibrium. We next introduce sub-game perfect epsilon-equilibrium and its variations, and review several sufficient topological conditions for its existence. In the final lecture of the course, we turn our attention to games with simultaneous moves, and review Blackwell determinacy and quitting games.

Registration and further information
Please contact Ville Suomala (email ville.suomala @ oulu.fi)

Welcome!

Last updated: 14.8.2019