Abstract
Boolean games are a logical setting for representing static games in a succinct way, taking advantage of the expressive power and succinctness of propositional logic. A Boolean game consists of a set of players, each of them controlling a set of propositional variables and having a specific goal expressed by a propositional formula, or more generally a specification of the player’s preference relation in some logical language for compact preference representation, such as prioritized goals. There is a lot of graphical structure hidden in a Boolean game: the satisfaction of each player’s goal depends on players whose actions have an influence on her goals. Exploiting this dependency structure facilitates the computation of pure Nash equilibria, by partly decomposing a game into several sub-games that are only loosely related.
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.
