Lipton; Mehta (2-player Nash Equilibria)
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/doi/10.1145/779928.779933")
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