Representations and solutions for game-theoretic problems
Artificial Intelligence - Special issue on economic principles of multi-agent systems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
Reinforcement learning: a survey
Journal of Artificial Intelligence Research
Smoothing Techniques for Computing Nash Equilibria of Sequential Games
Mathematics of Operations Research
Artificial Intelligence
Lossy stochastic game abstraction with bounds
Proceedings of the 13th ACM Conference on Electronic Commerce
Strategy purification and thresholding: effective non-equilibrium approaches for playing large games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Evaluating state-space abstractions in extensive-form games
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
Abstraction is a method often applied to keep the combinatorial explosion under control and to solve problems of large complexity. Ourwork focuses on applying abstraction to solve large stochastic imperfect-information games, specifically variants of poker.We examine several different medium-size poker variants and give encouraging results for abstraction-based methods on these games.