Abstract
In this paper, we propose an algorithm to verify whether a finite game is a coset weighted potential game (WPG) without pre-knowledge on its coset weights. This algorithm can also provide a recursive method to calculate the unknown coset weights. Then we give the concept of near coset WPGs based on evolutionary equivalence between two finite games, and its algebraic verification is obtained. Finally, the application of near coset WPGs to game-theoretical optimisation of multi-agent systems is discussed, which can improve the applicability of potential games in multi-agent optimisation problems.
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.
