The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
On the complexity of Nash equilibria of action-graph games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An Efficient PTAS for Two-Strategy Anonymous Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On oblivious PTAS's for nash equilibrium
Proceedings of the forty-first annual ACM symposium on Theory of computing
An optimal lower bound for anonymous scheduling mechanisms
Proceedings of the 10th ACM conference on Electronic commerce
Ranking games that have competitiveness-based strategies
Proceedings of the 11th ACM conference on Electronic commerce
On the complexity of pareto-optimal nash and strong equilibria
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Pseudorandom generators for combinatorial shapes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Survey: Nash equilibria: Complexity, symmetries, and approximation
Computer Science Review
Ranking games that have competitiveness-based strategies
Theoretical Computer Science
| Hi-index | 0.00 |
N/A