Abstract
A new kind of finite games, called quasi-potential game (QPG), including ordinal QPG, weighted QPG, and exact QPG, is proposed. It is proved that though a QPG may not be a potential game, it has the properties of potential games. The necessary and sufficient condition for verifying QPG is obtained. The algorithm that makes the QPG converge to the Nash equilibrium is presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 callMore From: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
Paper Title
Journal
Date
