Economic and Game Theory
|
"Inside every small problem is a large problem struggling to get out." | |||||
Topics | Thread and Full Text View
********************************************* Welcome to ExMIP 3.0 (Slim J.Belhaiza (c)). This program enumerates all Nash Extreme Equilibria for bimatrix games or sequential forms of two-persons extensive games. ********************************************* **************** Dominance Check *************** Strategy 1 of player 1 is eliminated: It is dominated by strategy 2 Strategy 2 of player 2 is eliminated: It is dominated by strategy 1 ******************** START ********************* Equilibrium 1 (node4) ******************* alpha_1 = 3 ; alpha_2 = 0 ; beta_1 = 1 ; beta_2 = 0 ; x_1 = 1 ; y_1 = 1 ; u_1 = 0 ; v_1 = 0 ; ******************** END *********************** Number of Equilibria :1 Number of Nodes :6 Computation Time in seconds :0 Equilibrium 1 : ***************** alpha_1 = 3 ; alpha_2 = 0 ; beta_1 = 1 ; beta_2 = 0 ; x_1 = 1 ; y_1 = 1 ; u_1 = 0 ; v_1 = 0 ; ********************* END *********************** ---------------------------- Value OBJ_LPA: 0 x_1=1 e_2=0 Value OBJ_LPB: 0 y_1=1 e_2=0 Equilibrium 1 is Perfect ---------------------------- [Manage messages] |