招认
囚徒2 招认 沉默 –5, -5 0, -8
-8, 0 -1 , -1
囚徒1
沉默
囚徒的困境
We now turn to the general case. The normal-form representation of a game specifies: (1)the players in the game;(2)the strategies available to each player;(3)the payoff received by each player for each combination of strategies that could be chosen by the players.
Definition: The normal-form representation of an-n-player game specifies the players‘ strategy spaces S1 , … , Sn and their payoff functions u1 ,…, un. We denote this game by G={S1, … ,Sn;u1, … , un}. 教材 P22
≥ ui( s1*…, sn-1* , si , sn+1* ,…, sn* ) ……………………………………….(NE)
for every feasible strategy si in Si; That is , si*solves max ui( s1*…, sn-1* , si, sn+1* ,…, sn* ). si∈Si
参与人2 左 中 右 上 1, 0 1, 2 0, 1
参与人1 下 0, 3 0,1 2,0 第二