应用免疫算法求解博弈问题  

Applying immune algorithm to solving game problem

作　　者：邱中华[1] 高洁[1] 朱跃星 

机构地区：[1]南京邮电大学数理学院,江苏南京210003 [2]中国农业银行深圳龙翔支行,广东深圳518000

出　　处：《系统工程学报》2006年第4期398-404,共7页Journal of Systems Engineering

基　　金：江苏省高校自然科学基金资助项目(04KJB110097)

摘　　要：设计了用于求解博弈问题的免疫算法的结构,讨论了二进制编码情况下的多样性控制,探讨了利用免疫算法求解博弈问题的方法和优势,分析了博弈问题的适应度评估方案,证实了设计的免疫算法具有稳定的收敛性.并通过对几个完全信息静态博弈实例的计算,验证了免疫算法求解博弈问题的有效性.The structure of the immune algorithm for solving game equilibrium is designed and the diversity control in the case of binary system coding is discussed in this paper. The method and the advantages of solving game problems by immune algorithm are studied and the fitness-evaluation scheme of game are also analyzed. And that the immune algorithm designed in this paper is of steady convergence is approved. The immune algorithm is applied successfully to solving several complement informational static games and the validity of solving game equilibrium by immune algorithm is validated.

关 键 词：免疫算法 NASH均衡 适应度评估 

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