Random instances of a graph coloring problem are hard
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The Strength of Weak Learnability
Machine Learning
On the theory of average case complexity
Journal of Computer and System Sciences
Journal of the ACM (JACM)
A competitive approach to game learning
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Making games short (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
Approximability and Parameterized Complexity of Minmax Values
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
A note on approximate Nash equilibria
Theoretical Computer Science
Efficient Methods for Selfish Network Design
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Algorithms for playing games with limited randomness
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Gradient-based algorithms for finding Nash equilibria in extensive form games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
A sublinear-time randomized approximation algorithm for matrix games
Operations Research Letters
Efficient methods for selfish network design
Theoretical Computer Science
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Randomized sampling for large zero-sum games
Automatica (Journal of IFAC)
Discrete Applied Mathematics
On the hardness of network design for bottleneck routing games
Theoretical Computer Science
| Hi-index | 0.00 |