On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Beyond VCG: Frugality of Truthful Mechanisms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Leontief economies encode nonzero sum two-player games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
The communication complexity of uncoupled nash equilibrium procedures
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Games of fixed rank: a hierarchy of bimatrix 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
Fast-converging tatonnement algorithms for one-time and ongoing market problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium
Communications of the ACM - Inspiring Women in Computing
On the Hardness of Being Truthful
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
On oblivious PTAS's for nash equilibrium
Proceedings of the forty-first annual ACM symposium on Theory of computing
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
On a Network Generalization of the Minmax Theorem
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
Algorithmic game theory is the research area in the interface between the theories of algorithms, networks, and games, which emerged more than a decade ago motivated by the advent of the Internet. "Snapshot" means several things: very personal point of view, of topical and possibly ephemeral interest, and put together in a hurry.