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 1

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

Prob.	Num𝑁	Num𝑆	NumEquilibra	Time (s)
1	3	4	1	0.53
2	3	4	2	0.62
3	3	4	2	0.56
4	3	5	3	0.56
5	3	6	2	0.41
6	3	6	1	0.66
7	3	7	5	0.59
8	3	8	6	0.58
9	3	8	3	0.89
10	3	8	3	0.81
11	3	10	2	1.00
12	3	11	3	1.47
13	3	12	4	1.81
14	3	14	4	4.91
15	3	14	8	3.81
16	3	15	6	5.87
17	3	19	13	27.86
18	3	19	3	33.40
19	3	21	13	47.28
20	3	23	10	102.51
21	3	24	22	122.94
22	3	25	21	239.20
23	3	26	13	278.50
24	3	26	15	301.58
25	3	28	21	419.97
26	3	33	22	1870.24
27	3	35	20	2082.34
28	3	40	24	4599.72
29	3	44	20	3033.29
30	3	45	26	16992.10