Lipton; Mehta (2-player Nash Equilibria)
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