The complexity of eliminating dominated strategies
Mathematics of Operations Research
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash equilibria of action-graph games
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Complexity of (iterated) dominance
Proceedings of the 6th ACM conference on Electronic commerce
Simple search methods for finding a Nash equilibrium
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A generalized strategy eliminability criterion and computational methods for applying it
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Mixed-integer programming methods for finding Nash equilibria
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
A continuation method for Nash equilibria in structured games
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Games of fixed rank: a hierarchy of bimatrix games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Factoring games to isolate strategic interactions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Algorithms for rationalizability and CURB sets
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Algorithms for closed under rational behavior (CURB) sets
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by computing a Nash equilibrium for a subcomponent, G, of O for which a certain condition holds. We also show that such a subcomponent G on which to apply the technique can be found in polynomial time (if it exists), by showing that the condition that G needs to satisfy can be modeled as a Horn satisfiability problem. We show that the technique does not extend to computing Pareto-optimal or welfare-maximizing equilibria. We present a class of games, which we call ALAGIU (Any Lower Action Gives Identical Utility) games, for which recursive application of (special cases of) the technique is sufficient for finding a Nash equilibrium in linear time. Finally, we discuss using the technique to compute approximate Nash equilibria.