STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the complexity of Nash equilibria of action-graph games
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximability and Parameterized Complexity of Minmax Values
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Computing exact and approximate Nash equilibria in 2-player games
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Making economic theory operational
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Parameterized two-player nash equilibrium
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
The complexity of decision problems about nash equilibria in win-lose games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
| Hi-index | 0.00 |