Abstract
AbstractIn this paper, potential equations of finite symmetric games are proposed to verify whether a symmetric game is potential or not. Some simpler verification conditions allowing a finite symmetric game to be a potential game are presented, along with a minimum number of verification equations. The obtained verification method is extended to other types of symmetric games, such as weighted symmetric games and skew‐symmetric games. Finally, two illustrative examples are given to demonstrate the effectiveness of the theoretical results.
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.
