Efficient approximation algorithms for the subset-sums equality problem
Journal of Computer and System Sciences
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Lower bounds for local search by quantum arguments
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum and classical query complexities of local search are polynomially related
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Nash Equilibria in Random Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
New upper and lower bounds for randomized and quantum local search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The computational complexity of nash equilibria in concisely represented games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Market equilibrium via a primal--dual algorithm for a convex program
Journal of the ACM (JACM)
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Complexity of pure equilibria in Bayesian games
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Direction Preserving Zero Point Computing and Applications
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the complexity of variations of equal sum subsets
Nordic Journal of Computing
Communications of the ACM
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Spending Constraint Utilities with Applications to the Adwords Market
Mathematics of Operations Research
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
Archive for Mathematical Logic
Market equilibrium under separable, piecewise-linear, concave utilities
Journal of the ACM (JACM)
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
Partial solutions with unique completion
Reasoning, Action and Interaction in AI Theories and Systems
Locally 2-dimensional sperner problems complete for the polynomial parity argument classes
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The complexity of approximate nash equilibrium in congestion games with negative delays
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The Computational Complexity of Nash Equilibria in Concisely Represented Games
ACM Transactions on Computation Theory (TOCT)
Recent development in computational complexity characterization of Nash equilibrium
Computer Science Review
Survey: Nash equilibria: Complexity, symmetries, and approximation
Computer Science Review
Inverting onto functions and polynomial hierarchy
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
The complexity of decision problems about nash equilibria in win-lose games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
| Hi-index | 5.24 |