Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
On total functions, existence theorems and computational complexity
Theoretical Computer Science
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Journal of the ACM (JACM)
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Towards a Characterization of Truthful Combinatorial Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Combinatorial Auctions
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Snipers, Shills, and Sharks: eBay and Human Behavior
Snipers, Shills, and Sharks: eBay and Human Behavior
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Game Theory
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computer science and game theory
Communications of the ACM - Designing games with a purpose
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
Computational challenges in e-commerce
Communications of the ACM - Rural engineering development
The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
Single-value combinatorial auctions and algorithmic implementation in undominated strategies
Journal of the ACM (JACM)
Truthful Approximation Schemes for Single-Parameter Agents
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On the Hardness of Being Truthful
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
The Complexity of Computing a Nash Equilibrium
SIAM Journal on Computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
CrowdScreen: algorithms for filtering data with humans
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
To boldly go: an occam-π mission to engineer emergence
Natural Computing: an international journal
Cake cutting: not just child's play
Communications of the ACM
| Hi-index | 48.23 |
A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior.