On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Communication complexity as a lower bound for learning in games
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Complexity of (iterated) dominance
Proceedings of the 6th ACM conference on Electronic commerce
Computing the optimal strategy to commit to
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A technique for reducing normal-form games to compute a Nash equilibrium
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Perspectives on multiagent learning
Artificial Intelligence
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Compact preference representation and Boolean games
Autonomous Agents and Multi-Agent Systems
Algorithms for rationalizability and CURB sets
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A generalized strategy eliminability criterion and computational methods for applying it
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
The Computational Complexity of Weak Saddles
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Algorithms for closed under rational behavior (CURB) sets
Journal of Artificial Intelligence Research
On the parameterized complexity of dominant strategies
ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
| Hi-index | 0.00 |