Lipton; Mehta (2-player Nash Equilibria)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{(O(log n)$)} (previously $O(n^{2} logn)$????) == Space Complexity == (see sheet {2}) words () == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/779928.779933")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{(O(log n)$)} (previously $O(n^{2} logn)$????)

Space Complexity

(see sheet {2}) words

()

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2003

Reference

https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/779928.779933

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Lipton;_Mehta_(2-player_Nash_Equilibria)&oldid=45309"