Games with imperfect information

Games have been extensively studied, either in computer science, mathematics or even economy. Nevertheless, each discipline has its own interest in using this formalism. Computer science for instance is attached to calculability issues. These results have some direct ap-plications in model checking or compilation. Recently, a new type of game has been introduced: games with imperfect information. They allow the modeling of more sophisticated systems, but bring also new calculability problems. In this document, we introduce a general method to prove the determinacy of any type of game. This method is used several times, and allow us to solve some open problems. This document introduces also several examples of important games stating for important properties. Then, a new type of game unifying the con-cepts of concurrency and imperfect information is presented. Finally, we discuss of the extension on infinite arenas