A Mixed 0-1 Linear Programming Approach to the Computation of All Pure-Strategy Nash Equilibria of a Finite n-Person Game in Normal Form

Table 6

The payoff function 𝑢^𝑖(𝑠^𝑖_𝑗,𝑠^−𝑖) is generated from 0 to 100 randomly.

Prob.	Num𝑁	Num𝑆	NumEquilibra	Time (s)
1	5	3	0	0.80
2	5	4	0	10.98
3	5	4	0	11.11
4	5	4	1	6.93
5	5	4	0	11.07
6	5	5	1	99.30
7	5	5	0	138.33
8	5	6	1	2408.44
9	5	6	2	1960.49
10	5	7	3	22237.60