On the complexity of local search
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
How difficult is the frequency selection problem?
Operations Research Letters
| Hi-index | 0.00 |