摘要
纳什均衡是一种博弈的解的概念,可以对非常广泛类型的博弈作出严格的多的预测。具有量子行为的粒子群算法是一种能够较好的解决优化问题的算法,它是在粒子群算法的基础上发展起来的。本文讨论纳什均衡解,并利用QPSO算法来求解纳什均衡解。通过仿真算法及与几种算法的比较结果验证了算法的有效性,证明了算法的全局收敛性。
Nash equilibrium is one kind of game solution concept,may make the strict many forecasts to extremely widespread type game.Quantum-behaved particle swarm optimization is introduced and presented based on the analysis of particle swarm optimization.ln this paper,the nash equilibrium solution is discussed and given by using QPSO.According to the simulation testing and the comparision with several algorithm is verified and the global convergence property of the algorithm is proved.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第10期48-51,共4页
Computer Engineering and Applications
基金
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60474030) 。
关键词
具有量子行为的粒子群算法
纳什均衡
扩展技术
排斥技术
博弈
quantum-behaved particle swarm optimization
hash equilibrium
stretching technique
repulsion technique
game
