Lemke-Howson Algorithm (2 player games Nash Equilibria)

From Algorithm Wiki
Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == Exponential == Space Complexity == $O(mn)$? words (I am not sure if this can be optimized?) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == Yes, == Model of Computation == Word RAM == Year == 1964 == Reference == https://doi.org/10.1137/0112033")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

Exponential

Space Complexity

$O(mn)$? words

(I am not sure if this can be optimized?)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

Yes,

Model of Computation

Word RAM

Year

1964

Reference

https://doi.org/10.1137/0112033

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Lemke-Howson_Algorithm_(2_player_games_Nash_Equilibria)&oldid=45725"