Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
