首页|On equivalence of state-based potential games

On equivalence of state-based potential games

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
In this paper,we explore state-based potential games using the semi-tensor product of matrices.First,applying the potential equation,we derive both a necessary and sufficient condition as well as a sufficient condition to verify whether a state-based game qualifies as a potential game.Next,we present two static equivalence conditions of state-based potential games.We then delve into dynamic equivalence.We propose a criterion that allows us to identify state-based games that are dynamically equivalent to state-based potential games and share similar dynamic properties.Ultimately,we introduce the concept of state-based networked evolutionary games.We provide a necessary and sufficient condition to ensure that a state-based networked evolutionary game can be classified as a state-based potential game.

semi-tensor product of matricesstate-based potential gameverificationequivalencestate-based networked evolutionary game

Han WU、Jinhuan WANG

展开 >

Institute of Mathematics,School of Science,Hebei University of Technology,Tianjin 300401,China

Natural Science Foundation of Hebei ProvinceGraduate Innovation Funding Program of Hebei Province

F2021202032CXZZSS2023033

2024

10.1007/s11432-023-3995-5

中国科学:信息科学(英文版)
中国科学院

中国科学:信息科学(英文版)

CSTPCDEI
影响因子：0.715
ISSN：1674-733X
年,卷(期)：2024.67(6)
  • 1