STP-based verification of extended finite multi-potential games
Zhipeng Zhang1
Haotian Peng2
Jianbo Song1
Zengqiang Chen3
1.School of Artificial Intelligence,Tiangong Univers2.School of Control Science and Engineering,Tiangong3.College of Artificial Intelligence,Nankai Universi
摘要：Potential games(PG)have attracted the attention of many researchers because of its excellent properties and multi-PG are more flexible and extensible,which greatly improve the application range of PG.Consider that weights and states to each player are common and practical in many application scenarios,and in this paper,by introducing weight value and state into multi-PG,q-weighted PG and q-state PG are systematically discussed and analyzed to expand the types of PG,respectively.First,using semi-tensor product of matrices(STP),a matrix approach to the modeling of weighted PG is investigated,and the verification method of weighted PG is proposed by defining three matrices,and the problem of how to detect weighted PG can be transformed to solve an algebraic equation,which is composed of the above three matrices.Next,by bringing weight values into multi-PG and detecting the weighted PG for each group,the verification method is extended to the q-weighted PG.Second,the model of state-based PG is constructed,and the problem of how to detect state-based PG can be transformed to solve another algebraic equation,which is seen as an extension of the verification method of weighted PG.Subsequently,the verification of q-state PG is discussed.Finally,we use two examples to demonstrate the validation of obtained results.
机标关键词：
论文发表日期：2025-12-30
在线出版日期：2026-01-09（本平台首次上网日期，不代表文献的发表时间）
页数：12( 590-601 )
英文信息