Abstract
The symmetric property in n-player games is explored in this paper. First of all, some algebraically verifiable conditions are provided respectively for the totally symmetric, weakly symmetric and anonymous games, which are based on the construction of permutation matrix, and some interesting properties are revealed. Then we investigate how network structures affect the symmetry in a networked game. Some sufficient conditions are proposed and several nice properties are preserved when traditional networked games are extended to generalized networked games, in which the resulting network structure is more complex than a classical network graph.
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.
