Abstract de la publi numéro 19157

A probabilistic analysis of Boolean games is presented. The class of Boolean games with payoff functions given by random Boolean formulas is studied. This permits to study certain properties of this class in its totality, such as the probability of the existence of a winning strategy, including its asymptotic behavior. With the help of the Coq proof assistant, we develop a Coq library of Boolean games, to provide a formal proof of our results, and a basis for future development.