Lemke–Howson algorithm (2-player Nash Equilibria): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:1511:15, 15 February 2023‎ Admin talk contribs‎ 347 bytes +347‎ 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.ezproxy.canberra.edu.au/doi/abs/10.1137/0112033?journalCode=smjmap.1"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Lemke–Howson_algorithm_(2-player_Nash_Equilibria)"