• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Course 'Elements of the theory of perfect information games: Determinacy, equilibrium, and subgame perfection' by Arkadi Predtetchinski

The event has been canceled. Please wait for further updates. We will announce new course dates in 2022.

We are glad to announce that the conference MEET-2021 will be followed by a mini-course 'Elements of the theory of perfect information games: Determinacy, equilibrium, and subgame perfection' on November 1-4. The course will be given by Arkadi Predtetchinski, an associate professor of Maastricht University. Everybody is welcome!

MEET-2021 Course (PDF, 85 Кб) 


Perfect information games are strategic situations where, at any stage of the game, each player knows what actions have been taken prior to that stage, i.e. she has perfect information about past play. Games of this type appear in a variety of disciplines: in descriptive set theory, logic, topology, analysis, and other areas of mathematics, computer science, and economics, just to name a few. For this reason, the theory of perfect information games is vast and multifaceted. The course touches upon but a few aspects of the theory.

Who is this course for? For anyone interested in mathematical game theory. While the course is meant to be largely self-contained, it does require a certain aptitude for abstract thinking and sure-footedness with mathematical reasoning. Knowledge of basic topology (open/closed sets, Borel sets) would be helpful but not indispensable.

For recent research by Arkadi Predtetchinski, see his personal website and the website of Maastricht University.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!
To be used only for spelling or punctuation mistakes.