nash.m

来自「一个求解纳什交换的均衡问题的例程」· M 代码 · 共 18 行

uofbill=[2,2,2,2,4,10,4,6,2];
uofjack=[4,2,1,2,1,1,1,2,2];
A=[1,1,1,1,1,0,0,0,0]*uofbill';
B=[0,0,0,0,0,1,1,1,1]*uofjack';
C=A*B;
bill=[1,1,1,1,1,0,0,0,0];
jack=[0,0,0,0,0,1,1,1,1];
for i=0:2^9-1
 a=realdec2bin(i)*uofbill';
 b=qiufan(realdec2bin(i))*uofjack';
 c=a*b;
 if (a>=A&b>=B&c>=C) A=a; B=b;C=c; 
     bill=realdec2bin(i);jack=qiufan(bill);
 end
end