2026-07-25T16:23:04Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9848 2024-03-06T10:42:25Z ddc:004 open_access

A Formal Study of Boolean Games with Random Formulas as Payoff Functions Martin-Dorel, Érik Soloviev, Sergei Boolean games Random process Coq formal proofs In this paper, we present a probabilistic analysis of Boolean games. We consider the class of Boolean games where payoff functions are given by random Boolean formulas. This permits to study certain properties of this class in its totality, such as the probability of existence of a winning strategy, including its asymptotic behaviour. 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 further developments. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Érik Martin-Dorel and Sergei Soloviev 2018 Is Part Of LIPIcs, Volume 97, 22nd International Conference on Types for Proofs and Programs (TYPES 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TYPES.2016.14 urn:nbn:de:0030-drops-98486 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2016.14 eng https://creativecommons.org/licenses/by/3.0/legalcode