Lemke–Howson algorithm (2-player Nash Equilibria)
Jump to navigation
Jump to search
Time Complexity
{2}^{($O(n+m)$)} (previously $O(n^{4})$????)
Space Complexity
$O(mn)$? words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1964
Reference
https://epubs.siam.org/doi/abs/10.1137/0112033?journalCode=smjmap.1