基于双矩阵博弈的群组聚合模型  

Coalescence model based on bimatrix game theory

作　　者：李娜 李佳美 马婧瑛 LI Na;LI Jiamei;MA Jingying(School of Mathematics and Statistics,Ningxia University,Yinchuan Ningxia 750021)

机构地区：[1]宁夏大学数学统计学院,宁夏银川750021

出　　处：《宁夏师范学院学报》2023年第1期32-42,共11页Journal of Ningxia Normal University

基　　金：宁夏自然科学基金项目(2021AAC03004);研究生创新项目(CXXM202219).

摘　　要：研究了多个独立个体组成的群组的聚合问题.首先,将个体间的交互作用建模为双矩阵博弈.其次,研究了完全信息个体和不完全信息个体组成的群组的聚合问题,给出了群组完成聚合的充分条件,并进一步证明了最终聚合状态在初始状态所形成的凸包内.最后,用几个仿真算例验证了理论结果的正确性,并分析了聚合时间的影响因素.In this paper,coalescence of a group composed of multiple independent is studied.Firstly,the interaction between individuals is modeled as a repeated bimatrix game.Secondly,coalescence of groups with agents of complete information and incomplete information are considered respectively.The sufficient condition of coalescence is obtained.It is shown that the final state of group is in the convex hull spanned by the initial states.Finally,several simulation examples are used to verify the correctness of the above theoretical results,and the factors affecting the polymerization time are analyzed.

关 键 词：群体智能 聚合问题 双矩阵博弈 混合纳什均衡 

分 类 号：O232[理学—运筹学与控制论]