In this sequence of two seminars, we will recall the basic definitions of games and parity games. We will give several proofs and applications of the most famous result in this context: the memoryless determinacy theorem. We will also see how some of these techniques naturally provide determinization procedures over infinite words.

This is in preparation to the seminars after the holidays, that will aim at presenting the results on the monadic theory of the infinite binary tree.