基于烟花算法的非合作博弈Nash均衡问题求解

详细信息    查看全文 | 推荐本文 |

英文篇名：SOLVING NASH EQUILIBRIUM OF NON-COOPERATIVE GAME BASED ON FIREWORKS ALGORITHM 作者：杨彦龙 ; 向淑文 ; 夏顺友 ; 贾文生 英文作者：Yang Yanlong;Xiang Shuwen;Xia Shunyou;Jia Wensheng;College of Computer Science and Technology ,Guizhou University;College of Mathematics and Statistics,Guizhou University; 关键词：烟花算法 ; 爆炸半径 ; 非合作博弈 ; Nash均衡 英文关键词：Fireworks algorithm;;Explosion radius;;Non-cooperative game;;Nash equilibrium 中文刊名：JYRJ 英文刊名：Computer Applications and Software 机构：贵州大学计算机科学与技术学院;贵州大学数学与统计学院; 出版日期：2018-03-15 出版单位：计算机应用与软件 年：2018 期：v.35 基金：国家自然科学基金项目(11161008,11561013);; 国家教育部博士点基金项目(20115201110002) 语种：中文; 页：JYRJ201803042 页数：4 CN：03 ISSN：31-1260/TP 分类号：221-224

摘要

提出一种求解N人有限非合作博弈Nash均衡的群体智能算法—烟花算法(FWA)。烟花爆炸后产生爆炸火花和高斯变异火花,根据火花的适应度值的好坏产生下一代烟花,适应度值较好的火花在较小范围内产生较多的爆炸火花,反之,适应度值较差的火花在较大范围内产生较少的爆炸火花。通过高斯变异火花增加种群的多样性,这种爆炸搜索机制对较好火花附近的区域搜索更加彻底并且避免过早陷入局部寻优。实验结果表明,烟花算法在求解N人有限非合作博弈Nash均衡问题上优于免疫粒子群算法。
        The fireworks algorithm( FWA) is proposed to solve finite non-cooperative game among N people. The fireworks generate explosive and gaussian mutation sparks,then the next sparks are generated based on fitness. Sparks with higher fitness will generate more explosive sparks in smaller scope while sparks with lower fitness will generate less explosive sparks in larger scope. This explosive searching mechanism can provide a more complete search in area of greater sparks and avoid falling into local optimum based on the increased group diversity by Gaussian mutation. The results demonstrate that the proposed algorithm is effective and superior to the immune particle swarm algorithm in solving Nash equilibrium of non-cooperative game among N people.

引文

[1]Lemke C,Howson J.Equilibrium points of bimatrix games[J].Journal of Society for Industrial and Applied Mathematics,1964,12(2):431-423.
    [2]Govindan S,Wilson R.A global Newton method for computing Nash equilibria[J].Journal of Economic Theory,2003,110(1):65-86.
    [3]Zhang Jian-zhong,Qu Biao,Xiu Nai-hua.Some projectionlike methods for the generalized Nash equilibria[J].Computational Optimization and Applications,2010,45(1):89-109.
    [4]Herings P J J,Peeters R.Homotopy methods to compute equilibria in game theory[J].Economic Theory,2010,42(1):119-156.
    [5]Yuan Ya-xiang.A trust region algorithm for Nash equilibria problems[J].Pacific Journal of Optimization,2011,7(1):125-138.
    [6]邱中华,高洁,朱跃星.应用免疫算法求解博弈问题[J].系统工程学报,2006,21(4):398-404.
    [7]王志勇,韩旭,许维胜,等.基于改进蚁群算法的纳什均衡求解[J].计算机工程,2010,36(14):166-171.
    [8]贾文生,向淑文,杨剑锋,等.基于免疫粒子群算法的广义Nash均衡问题求解[J].计算机应用研究,2013,30(9):2637-2640.
    [9]贾文生,向淑文,杨剑锋,等.基于自适应小生境粒子群算法的多重Nash均衡求解[J].计算机应用与软件,2015,32(1):247-250.
    [10]Tan Y,Zhu Y.Fireworks algorithm for optimization[C]//International Conference on Advances in Swarm Intelligence.Springer-Verlag,2010:355-364.
    [11]谭营,郑少秋.烟花算法研究进展[J].智能系统学报,2014,9(5):515-528.
    [12]谭营.烟花算法引论[M].北京:科学出版社,2015:23-28.
    [13]王培崇.融合佳点集机制的动态搜索烟花爆炸搜索算法[J].计算机应用与软件,2015,32(8):248-251.
    [14]王培崇,李丽荣.改进的混合混沌烟花爆炸搜索算法[J].微电子学与计算机,2014,31(11):69-73.
    [15]黄伟建,郭芳.基于烟花算法的云计算多目标任务调度[J].计算机应用研究,2017,34(6):1718-1720.
    [16]包晓晓,叶春明,黄霞.烟花算法求解JSP问题的研究[J].计算机工程与应用,2017,53(3):247-252.
    [17]Zheng Y J,Song Q,Chen S Y.Multiobjective fire-works optimization for variable-rate fertilization in oil crop production[J].Applied Soft Computing,2013,13(11):4253-4263.