求解非完全信息对策Nash平衡解的学习算法

A Simulation Model Algorithm of Nash Equilibrium of Incomplete Information Games

基于动物进化论思想 ,把二人两边非完全信息对策转化为n次重复对策。根据每两次重复对策之间有一定的关系 ,通过构造关系G =(1n ni=1 aij) / ( ni =1 nj=1 piE(X(n) ,Y(n) )qj) 。

In this paper,based on the animal evolution theory, two people and two sides incomplete information games are changed into n times repeat games.According to a relation between every two times games,and through the structural relation of G=(1nni=1 a ij )/(ni=1nj=1 p iE(X(n),Y(n))q j), A simulation algorithm of Nash eqilibrium is presented.