Abstract
Abstract Using semi-tensor product of matrices, the vector space structure of Boolean games and their some specified subsets are proposed. By resorting to the vector space structure and potential equation, we give an alternative proof for the fact that a symmetric Boolean game is a potential game. The two advantages of this new approach are revealed as follows: (1) It can provide the corresponding potential function; (2) It can be used to explore new potential Boolean games. The corresponding formula is provided to demonstrate the first advantage. As for the second one, the renaming symmetric Boolean games and the weighted symmetric Boolean games are also proved to be potential and weighted potential respectively. Moreover, as a non-symmetric game, the flipped symmetry Boolean game has been constructed and proved to be potential.
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.
