Abstract
<abstract><p>In this paper, skew-symmetric games and a symmetric-based decomposition of finite games are investigated. First, necessary and sufficient conditions for testing skew-symmetric games are obtained by the semi-tensor product method based on adjacent transpositions. By using the obtained conditions for skew-symmetric games, a basis of the skew-symmetric game subspace is constructed. Then, the discriminant equations for a skew-symmetric game with the minimum number are derived. Furthermore, based on the basis of the skew-symmetric game subspace and that of the symmetric game subspace, a basis of the asymmetric game subspace is constructed, which completely solves the problem of symmetric-based decomposition of finite games. Finally, an illustrative example is provided to validate the obtained theoretical results.</p></abstract>
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.
