Lipton, Markakis and Mehta method 2 (n player games Nash Equilibria)

Time Complexity

$O(n^{ck^{2} log (k^{2}n)$/eps^2})

Space Complexity

$O(k^{2}log^{2} n/eps^{2})$ words

()

Approximate?

Approximate

Approximation Factor:

Randomized?

Yes,

Model of Computation

Word RAM words

Year

2003

Reference

https://dl.acm.org/doi/10.1145/779928.779933