Lemke–Howson algorithm (2-player Nash Equilibria)

From Algorithm Wiki
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Lemke–Howson_algorithm_(2-player_Nash_Equilibria)&oldid=45307"