Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Continuous First-Order Constraint Satisfaction
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Multi-agent algorithms for solving graphical games
Eighteenth national conference on Artificial intelligence
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
A language for modeling agents' decision making processes in games
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Using computer algebra to find nash equilibria
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
An interval component for continuous constraints
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Simple search methods for finding a Nash equilibrium
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
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
Multi-agent influence diagrams for representing and solving games
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Graphical models for game theory
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
Finding Nash equilibria is a hard computational problem which is central to game theory and whose applications range from decision-making to the analysis of multi-agent systems. Despite considerable recent interest and significant recent improvements, the problem remains essentially open in the case of n-person games. We investigate the use of interval-based constraint solving techniques to compute equilibria. We report on experiments made using several encodings of randomly-generated games into continuous CSP, and draw conclusions regarding both the scalability of interval methods for game-theoretic applications and the impact of the symbolic representation of polynomials and of the choice of the propagation technique on the speed of resolution.